75 search results - page 14 / 15 » Optimal splitters for database partitioning with size bounds |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
SSD
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
EDBT
1998
ACM
13 years 9 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
ICCAD
2008
IEEE
14 years 2 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...