1773 search results - page 54 / 355 » A new partitioning scheme for improvement of image computati... |
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
DAC
1999
ACM
15 years 4 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...
103
click to vote
MICRO
2007
IEEE
15 years 6 months ago
2007
IEEE
The recent design shift towards multicore processors has spawned a significant amount of research in the area of program parallelization. The future abundance of cores on a singl...
DAC
2005
ACM
15 years 1 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...