- Efficient Fast Hartley Transform Algorithms for HypercubeConnected Multicomputers \Lambda
- Information Systems 33 (2008) 117 Clustering spatial networks for aggregate query processing
- J. Parallel Distrib. Comput. 67 (2007) 271285 www.elsevier.com/locate/jpdc
- ENCAPSULATING MULTIPLE COMMUNICATION-COST METRICS IN PARTITIONING SPARSE RECTANGULAR MATRICES FOR
- Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices
- PERMUTING SPARSE RECTANGULAR MATRICES INTO BLOCK-DIAGONAL FORM
- Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on
- A Parallel Progressive Radiosity Algorithm Based on Patch Data Circulation 1
- Effect of Inverted Index Partitioning Schemes on Performance of Query Processing in
- Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
- A NEW MAPPING HEURISTIC BASED ON
- J. Parallel Distrib. Comput. 66 (2006) 3246 www.elsevier.com/locate/jpdc
- ALGORITHMS FOR EFFICIENT VECTORIZATION OF REPEATED SPARSE POWER SYSTEM NETWORK COMPUTATIONS
- J. Parallel Distrib. Comput. 68 (2008) 609625 www.elsevier.com/locate/jpdc
- Decomposing Linear Programs for Parallel Solution?
- A parallel scaled conjugate-gradient
- Chat Mining for Gender Prediction Tayfun Kucukyilmaz, B. Barla Cambazoglu,
- A Comparison of Spatial Subdivision Algorithms for SortFirst Rendering ?
- Image-Space-Parallel Direct Volume Rendering on a Cluster of PCs
- Journal of Parallel and Distributed Computing 61, 1148 1179 (2001) Adaptive Routing on the New Switch Chip
- A Message Ordering Problem in Parallel Programs
- A Global Routing Heuristic for FPGAs Based on Mean Field Annealing
- Active Pixel Merging on Hypercube Multicomputers?
- Efficient Overlapped FFT Algorithms for Hypercube-Connected Multicomputers
- Journal of Supercomputing, 15, 5193 (2000) 2000 Kluwer Academic Publishers. Manufactured in The Netherlands.
- An Effective Model to Decompose Linear Programs for Parallel Solution ?
- Chat mining: Predicting user and message attributes in computer-mediated communication
- J. Parallel Distrib. Comput. 68 (2008) 14731486 Contents lists available at ScienceDirect
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. SCI. COMPUT. c 2007 Society for Industrial and Applied Mathematics
- Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct
- Architecture of a grid-enabled Web search engine B. Barla Cambazoglu, Evren Karaca, Tayfun Kucukyilmaz, Ata Turk,
- J. Parallel Distrib. Comput. 67 (2007) 186204 www.elsevier.com/locate/jpdc
- J. Parallel Distrib. Comput. 67 (2006) 7799 www.elsevier.com/locate/jpdc
- Information Systems 30 (2005) 4770 Iterative-improvement-based declustering heuristics
- Data Mining and Knowledge Discovery, 9, 2957, 2004 c 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
- J. Parallel Distrib. Comput. 64 (2004) 974996 Fast optimal load balancing algorithms for 1D partitioning$
- Data-Parallel Web Crawling Models Berkant Barla Cambazoglu, Ata Turk, and Cevdet Aykanat
- Computers & Graphics 27 (2003) 387406 Technical section
- Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
- Technical Section OBJECT-SPACE PARALLEL POLYGON RENDERING ON
- IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 16, NO. 2, FEBRUARY 1997 169 Two Novel Multiway Circuit Partitioning
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO. 6, JUNE 1995 561 Efficient Fast Hartley Transform Algorithms
- 448 IEEETransactionson Powa Systems,Vol. 10. No. 1, February 1995 ALGORITHMSFOR EFFICIENTVECTORIZATION OF
- CIRCUIT PARTITIONING USING MEAN FIELD ANNEALING
- An E cient Mean Field Annealing Formulation for Mapping Unstructured Domains to
- An Efficient Parallel Spatial Subdivision Algorithm for Object-Based Parallel Ray Tracing
- Routing Algorithms for IBM SP1 Bulent Abali1 and Cevdet Aykanat2
- 1554 IEEE TRANSACTIONS ON COMPUTERS, VOL. 37, NO. 12. DECEMBER 19x8 Iterative Algorithms for Solution of Large Sparse
- A link-based storage scheme for efficient aggregate query processing on clustered road networks$
- An E cient Mapping Heuristic for Mesh-Connected Parallel Architectures Based
- Contributed article A fast neural-network algorithm for VLSI cell placement
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM REVIEW c 2007 Society for Industrial and Applied Mathematics
- Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication?
