Sciweavers

1012 search results - page 55 / 203
» Segment intersection searching problems in general settings
Sort
View
TKDE
2002
141views more  TKDE 2002»
14 years 11 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 27 days ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
IUI
2009
ACM
15 years 8 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
IJRR
2000
113views more  IJRR 2000»
14 years 11 months ago
Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
Howie Choset, Joel W. Burdick
SIGIR
2003
ACM
15 years 5 months ago
Domain-independent text segmentation using anisotropic diffusion and dynamic programming
This paper presents a novel domain-independent text segmentation method, which identifies the boundaries of topic changes in long text documents and/or text streams. The method c...
Xiang Ji, Hongyuan Zha