| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Fillia Makedon Fillia Makedon, Song Ye , Sheng Zhang , James Ford , Li Shen , Sarantos Kapidakis : Data Brokers: Building Collections through Automated Negotiation. SETN 2004 : 13-22 Despina Kontos , Vasileios Megalooikonomou , Fillia Makedon: Computationally Intelligent Methods for Mining 3D Medical Images. SETN 2004 : 72-81 Yuhang Wang , Fillia Makedon: R-Histogram: quantitative representation of spatial relations for similarity-based image retrieval. ACM Multimedia 2003 : 323-326 Song Ye , Fillia Makedon, Tilmann Steinberg , Li Shen , James Ford , Yuhang Wang , Yan Zhao , Sarantos Kapidakis : SCENS: A System for the Mediated Sharing of Sensitive Data. JCDL 2003 : 263- Yuhang Wang , Tilmann Steinberg , Fillia Makedon, James Ford , Heather Wishart , Andrew J. Saykin : Quantifying Evolving Processes in Multimodal 3D Medical Images. MICCAI (2) 2003 : 101-108 Li Shen , James Ford , Fillia Makedon, Yuhang Wang , Tilmann Steinberg , Song Ye , Andrew J. Saykin : Morphometric Analysis of Brain Structures for Improved Discrimination. MICCAI (2) 2003 : 513-520 James Ford , Hany Farid , Fillia Makedon, Laura A. Flashman , Thomas W. McAllister , Vasilis Megalooikonomou , Andrew J. Saykin : Patient Classification of fMRI Activation Maps. MICCAI (2) 2003 : 58-65 Tilmann Steinberg , Yuhang Wang , Fillia Makedon, Li Shen , Andrew J. Saykin , Heather Wishart : A Spatio-temporal Multi-modal Data Management and Analysis Environment for Tracking MS Lesions. SSDBM 2003 : 245-246 Fillia Makedon, James Ford , Li Shen , Tilmann Steinberg , Andrew J. Saykin , Heather Wishart , Sarantos Kapidakis : MetaDL: A Digital Library of Metadata for Sensitive or Complex Research Data. ECDL 2002 : 374-389 Li Shen , Ling Cheng , James Ford , Fillia Makedon, Vasileios Megalooikonomou , Tilmann Steinberg : Mining the Most Interesting Web Access Associations. WebNet 2000 : 489-494 Fillia Makedon: Human Brain Data on the Web: A New Tool for Medical Research. WebNet 2000 : 601-604 Charles B. Owen , James Ford , Fillia Makedon, Tilmann Steinberg , Christina Metaxaki-Kossionides : Parallel text alignment. Int. J. on Digital Libraries 3 (1): 100-114 (2000) Peter A. Gloor , Fillia Makedon, James Ford , Tilmann Steinberg , Charles B. Owen , Basil Sudborough : Multimedia Interfaces for E-Commerce. WebNet 1999 : 445-450 James Ford , Fillia Makedon, Charles B. Owen , Sterling Johnson , Andrew J. Saykin : Stimulus Tracking in Functional Magnetic Resonance Imaging (fMRI). ACM Multimedia 1998 : 445-454 Ann De Bord , James Ford , Fillia Makedon, Theodore P. Prizio , Mihalis Sasles , Charles B. Owen : Documentation Multi-Targeting Using ASML & JavaScript. WebNet 1998 Samuel A. Rebelsky , Fillia Makedon, Panagiotis Takis Metaxas , James Ford , Charles B. Owen , Peter A. Gloor : The Roles of Video in the Design, Use, and Construction of Interactive Electronic Conference Proceedings. J. UCS 4 (6): 604-628 (1998) Charles B. Owen , Fillia Makedon: Asml: Automatic Site Markup Language. Multimedia Tools Appl. 6 (2): 113-139 (1998) Peter A. Gloor , Fillia Makedon, Oliver van Ligten : Obstacles in Web Multimedia Publishing: Bringing Conference Proceedings On-Line. Multimedia Tools Appl. 6 (2): 171-180 (1998) James Ford , Fillia Makedon, Samuel A. Rebelsky : Resource-Limited Hyper-Reproductions: Electronically Reproducing and Extending Lectures. Multimedia Tools Appl. 6 (2): 181-197 (1998) Fillia Makedon, Samuel A. Rebelsky : Guest Editorial. Multimedia Tools Appl. 6 (2): 93-96 (1998) Charles B. Owen , Fillia Makedon: Bottleneck-Free Separable Affine Image Warping. ICIP (1) 1997 : 683-686 Charles B. Owen , Fillia Makedon, Glen Frank , Michael Kenyon : ASML: Automatic Site Markup Language. WebNet 1997 James Haralambides , Fillia Makedon: Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. Theory Comput. Syst. 30 (1): 67-90 (1997) Matthew Cheyney , Peter A. Gloor , Donald B. Johnson , Fillia Makedon, James Matthews , Panagiotis Takis Metaxas : Toward Multimedia Conference Proceedings. Commun. ACM 39 (1): 50-59 (1996) Fillia Makedon, Antonios Symvonis : Flit-Serial Packet Routing on Meshes and Tori. Mathematical Systems Theory 29 (4): 311-330 (1996) Samuel A. Rebelsky , James Ford , Kenneth Harker , Fillia Makedon, Panagiotis Takis Metaxas , Charles B. Owen : Interactive multimedia conference proceedings. CHI 95 Conference Companion 1995 : 13-14 Frank Thomson Leighton , Fillia Makedon, Ioannis G. Tollis : A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues. Algorithmica 14 (4): 291-304 (1995) Frank Thomson Leighton , Fillia Makedon, Serge A. Plotkin , Clifford Stein , Éva Stein , Spyros Tragoudas : Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50 (2): 228-243 (1995) Fillia Makedon, Antonios Symvonis : Optimal-Algorithms for Multipacket Routing Problems on Rings. J. Parallel Distrib. Comput. 22 (1): 37-43 (1994) James Matthews , Peter A. Gloor , Fillia Makedon: VideoScheme: A Programmable Video Editing Systems for Automation and Media Recognition. ACM Multimedia 1993 : 419-426 Fillia Makedon, Antonios Symvonis : An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements. IEEE Trans. Parallel Distrib. Syst. 4 (3): 270-276 (1993) Fillia Makedon, Dafna Sheinwald , Yaron Wolfsthal : A Simple Linear-Time Algorithm for the Recognition of Bandwidth-2 Biconnected Graphs. Inf. Process. Lett. 46 (2): 103-107 (1993) Dimitrios Kagaris , Fillia Makedon, Spyros Tragoudas : On Minimizing Hardware Overhead for Pseudoexhaustive Circuit Testability. ICCD 1992 : 358-364 Dinesh Bhatia , Frank Thomson Leighton , Fillia Makedon, Carolyn Haibt Norton : Improved Algorithms for Routing on Two-Dimensional Grids. WG 1992 : 114-122 Fillia Makedon, Adonios Simvonis : Multipacket Routing on Rings. ACPC 1991 : 226-237 James Haralambides , Fillia Makedon: Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. ICCI 1991 : 66-77 Frank Thomson Leighton , Fillia Makedon, Serge A. Plotkin , Clifford Stein , Éva Tardos , Spyros Tragoudas : Fast Approximation Algorithms for Multicommodity Flow Problems STOC 1991 : 101-111 James Haralambides , Fillia Makedon, Burkhard Monien : Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Mathematical Systems Theory 24 (3): 169-177 (1991) Dinesh Bhatia , Frank Thomson Leighton , Fillia Makedon: Efficient Reconfiguration of WSI Arrays. ICSI 1990 : 47-56 Fillia Makedon, Spyros Tragoudas : Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems. WG 1990 : 140-153 Fillia Makedon, Malgorzata Marek-Sadowska : Analysis of Heuristic Reasoning for the Visualization of CAD Quadratic. ICCAL 1989 : 359-378 Mohamed Ouksel , Fillia Makedon: The Anatomy of an Object Oriented Visualization System for Algorithm Design. ICCAL 1989 : 438-451 Frank Thomson Leighton , Fillia Makedon, Ioannis G. Tollis : A 2 n -2 Step Algorithm for Routing in an nxn Array with Constant Size Queues. SPAA 1989 : 328-335 William A. Payne III , Fillia Makedon, W. Robert Daasch : High Speed Interconnection Using the Clos Network. ICS 1987 : 96-111 Fillia Makedon, Kurt Mehlhorn , Theodore S. Papatheodorou , Paul G. Spirakis : VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings Springer 1986 Moon-Jung Chung , Fillia Makedon, Ivan Hal Sudborough , Jonathan S. Turner : Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. SIAM J. Comput. 14 (1): 158-177 (1985) Fillia Makedon, Christos H. Papadimitriou , Ivan Hal Sudborough : Topological Bandwidth. CAAP 1983 : 317-331 Fillia Makedon, Ivan Hal Sudborough : Minimizing Width in Linear Layouts. ICALP 1983 : 478-490 Moon-Jung Chung , Fillia Makedon, Ivan Hal Sudborough , Jonathan S. Turner : Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees FOCS 1982 : 262-271 1 [ 11 ] [ 16 ] 2 [ 35 ] 3 [ 40 ] 4 [ 26 ] 5 [ 1 ] [ 4 ] 6 [ 6 ] 7 [ 43 ] 8 [ 43 ] 9 [ 24 ] [ 31 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 40 ] [ 41 ] [ 43 ] [ 44 ] [ 45 ] [ 46 ] [ 49 ] 10 [ 28 ] 11 [ 20 ] [ 26 ] [ 32 ] [ 34 ] [ 37 ] 12 [ 12 ] [ 14 ] [ 27 ] 13 [ 24 ] 14 [ 26 ] 15 [ 36 ] 16 [ 17 ] 17 [ 41 ] [ 46 ] [ 49 ] 18 [ 28 ] 19 [ 48 ] 20 [ 7 ] [ 11 ] [ 13 ] [ 16 ] [ 22 ] [ 23 ] 21 [ 32 ] 22 [ 9 ] 23 [ 20 ] [ 26 ] 24 [ 43 ] 25 [ 40 ] [ 48 ] 26 [ 43 ] 27 [ 5 ] 28 [ 38 ] 29 [ 24 ] [ 26 ] [ 34 ] 30 [ 12 ] 31 [ 16 ] 32 [ 8 ] 33 [ 24 ] [ 28 ] [ 29 ] [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] 34 [ 3 ] 35 [ 5 ] 36 [ 6 ] 37 [ 13 ] [ 22 ] 38 [ 35 ] 39 [ 24 ] [ 30 ] [ 31 ] [ 34 ] 40 [ 35 ] 41 [ 36 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 45 ] 42 [ 18 ] 43 [ 40 ] [ 41 ] [ 42 ] [ 44 ] [ 46 ] [ 49 ] 44 [ 15 ] 45 [ 5 ] 46 [ 13 ] [ 22 ] 47 [ 22 ] 48 [ 37 ] [ 38 ] [ 40 ] [ 41 ] [ 42 ] [ 44 ] [ 45 ] [ 46 ] 49 [ 37 ] 50 [ 1 ] [ 2 ] [ 3 ] [ 4 ] 51 [ 19 ] [ 21 ] [ 25 ] 52 [ 13 ] 53 [ 7 ] [ 23 ] 54 [ 10 ] [ 13 ] [ 17 ] [ 22 ] 55 [ 1 ] [ 4 ] 56 [ 42 ] [ 44 ] [ 45 ] [ 46 ] [ 47 ] 57 [ 41 ] [ 42 ] [ 45 ] 58 [ 18 ] 59 [ 44 ] [ 46 ] [ 49 ] 60 [ 49 ] 61 [ 46 ]  ©2004 Association for Computing Machinery |
