5746 search results - page 88 / 1150 » Visualizing Query Structure |
135
Voted
CLEF
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. This paper describes a visual localization approach for mobile robots. Robot localization is performed as location recognition. The approach uses global visual features (...
158
click to vote
EDBT
1998
ACM
15 years 6 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...
119
click to vote
CCCG
2008
15 years 3 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
149
Voted
COCOON
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
112
Voted
COCO
1989
Springer
15 years 6 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...