Sciweavers

765 search results - page 149 / 153
» Empirical Design of Geometric Algorithms
Sort
View
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
IUI
2004
ACM
14 years 25 days ago
Sheepdog: learning procedures for technical support
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
Tessa A. Lau, Lawrence D. Bergman, Vittorio Castel...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 24 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
JCDL
2010
ACM
199views Education» more  JCDL 2010»
14 years 14 days ago
Crowdsourcing the assembly of concept hierarchies
The“wisdom of crowds”is accomplishing tasks that are cumbersome for individuals yet cannot be fully automated by means of specialized computer algorithms. One such task is the...
Kai Eckert, Mathias Niepert, Christof Niemann, Cam...
IPSN
2010
Springer
13 years 11 months ago
Practical modeling and prediction of radio coverage of indoor sensor networks
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...
Octav Chipara, Gregory Hackmann, Chenyang Lu, Will...