Sciweavers

2393 search results - page 305 / 479
» Bounds-Consistent Local Search
Sort
View
119
Voted
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 3 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 3 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 2 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
117
Voted
SAC
2010
ACM
15 years 9 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
159
Voted
CEC
2009
IEEE
15 years 9 months ago
Examination timetabling using late acceptance hyper-heuristics
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...
Ender Özcan, Yuri Bykov, Murat Birben, Edmund...