Sciweavers

2457 search results - page 376 / 492
» Local Search with Bootstrapping
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 6 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
SIGIR
2012
ACM
13 years 6 months ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 4 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
16 years 4 months ago
Anomaly pattern detection in categorical datasets
We propose a new method for detecting patterns of anomalies in categorical datasets. We assume that anomalies are generated by some underlying process which affects only a particu...
Kaustav Das, Jeff G. Schneider, Daniel B. Neill
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 10 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...