Sciweavers

4850 search results - page 81 / 970
» Approximate Data Structures with Applications
Sort
View
NIPS
2004
14 years 11 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
15 years 10 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
WWW
2010
ACM
15 years 3 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
ESWS
2010
Springer
15 years 2 months ago
Leveraging Terminological Structure for Object Reconciliation
Abstract. It has been argued that linked open data is the major benefit of semantic technologies for the web as it provides a huge amount of structured data that can be accessed i...
Jan Noessner, Mathias Niepert, Christian Meilicke,...
COMGEO
2007
ACM
14 years 10 months ago
Delaunay triangulations approximate anchor hulls
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
Tamal K. Dey, Joachim Giesen, Samrat Goswami