4047 search results - page 707 / 810 » The Discrete Basis Problem |
145
Voted
ISPD
2004
ACM
15 years 9 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
137
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
128
Voted
PODC
2003
ACM
15 years 9 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
187
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
122
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...