Sciweavers

4229 search results - page 254 / 846
» On the Optimality of Spiral Search
Sort
View
128
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 3 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
SPIESR
2000
104views Database» more  SPIESR 2000»
15 years 3 months ago
Feature localization and search by object model under illumination change
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
Mark S. Drew, Zinovi Tauber, Ze-Nian Li
IPM
2006
77views more  IPM 2006»
15 years 1 months ago
Effective search results summary size and device screen size: Is there a relationship?
In recent years, small screen devices have seen widespread increase in their acceptance and use. Combining mobility with increased technological advances many such devices can now...
Simon O. Sweeney, Fabio Crestani
ENTCS
2007
190views more  ENTCS 2007»
15 years 1 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
CP
2009
Springer
14 years 11 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey