Sciweavers

6095 search results - page 741 / 1219
» Learning in Local Search
Sort
View
ICCV
1999
IEEE
16 years 8 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
WWW
2007
ACM
16 years 7 months ago
Query topic detection for reformulation
In this paper, we show that most multiple term queries include more than one topic and users usually reformulate their queries by topics instead of terms. In order to provide empi...
Xuefeng He, Jun Yan, Jinwen Ma, Ning Liu, Zheng Ch...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 7 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
CHI
2001
ACM
16 years 7 months ago
Visual information foraging in a focus + context visualization
Eye tracking studies of the Hyperbolic Tree browser [10] suggest that visual search in focus+context displays is highly affected by information scent (i.e., local cues, such as te...
Peter Pirolli, Stuart K. Card, Mija M. Van Der Weg...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 7 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis