651 search results - page 27 / 131 » Index Sets and Universal Numberings |
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
CVDB
2004
ACM
14 years 2 months ago
2004
ACM
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
DASFAA
2009
IEEE
14 years 4 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...