Sciweavers

335 search results - page 18 / 67
» High quality graph partitioning
Sort
View
EDBT
2008
ACM
106views Database» more  EDBT 2008»
14 years 11 months ago
Highly scalable trip grouping for large-scale collective transportation systems
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
Gyözö Gidófalvi, Torben Bach Pede...
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 3 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
15 years 7 days ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
13 years 9 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
HPCA
2008
IEEE
14 years 11 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...