804 search results - page 116 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
IJON
2010
13 years 5 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
Our study addresses the problem of large-scale contradiction detection and management, from data extracted from the Web. We describe the first systematic solution to the problem,...
ICDE
2008
IEEE
14 years 2 months ago
2008
IEEE
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...