Sciweavers

4850 search results - page 73 / 970
» Approximate Data Structures with Applications
Sort
View
ISCI
2000
84views more  ISCI 2000»
14 years 9 months ago
Automating the approximate record-matching process
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors re...
Vassilios S. Verykios, Ahmed K. Elmagarmid, Elias ...
CCCG
2006
14 years 11 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 3 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
SIP
2003
14 years 11 months ago
Robust Range Data Segmentation using Geometric Primitives for Robotic Applications
This paper presents a data-driven approach for segmenting range data to enable a humanoid robot to perform interactive domestic tasks. Range data is segmented into geometric primi...
Geoffrey Taylor, Lindsay Kleeman
EMMCVPR
2001
Springer
15 years 2 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...