1299 search results - page 76 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
DAC
2005
ACM
14 years 11 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...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
WG
1993
Springer
15 years 1 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
PODS
2002
ACM
15 years 10 months ago
2002
ACM
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
WISE
2007
Springer
15 years 4 months ago
2007
Springer
Information in a deep Web source can be accessed through queries submitted on its query interface. Many Web applications need to interact with the query interfaces of deep Web sour...