Sciweavers

1105 search results - page 87 / 221
» Approximate Spectral Clustering.
Sort
View
CAGD
2008
154views more  CAGD 2008»
15 years 24 days ago
From extension of Loop's approximation scheme to interpolatory subdivisions
The minimum-supported bivariate C2-cubic spline on a 6-directional mesh constructed in our previous work [2] can be used to extend Loop's approximation subdivision scheme to ...
Charles K. Chui, Qingtang Jiang
ICCV
2011
IEEE
14 years 21 days ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
119
Voted
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 4 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 10 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
16 years 2 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...