Sciweavers

9477 search results - page 1649 / 1896
» Design is as Easy as Optimization
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 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
IOPADS
1997
94views more  IOPADS 1997»
15 years 8 months ago
Remote I/O Fast Access to Distant Storage
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
Ian T. Foster, David Kohr, Rakesh Krishnaiyer, Jac...
SPIESR
1997
97views Database» more  SPIESR 1997»
15 years 8 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
WSC
1997
15 years 8 months ago
Simulation-based Planning for Multi-Agent Environments
One of the key issues in reasoning with multiple interacting intelligent agents is how to model and code the decision making process of the agents. In Artificial Intelligence (AI...
Jin Joo Lee, Paul A. Fishwick
WSC
1997
15 years 8 months ago
Minimum Cost Adaptive Synchronization: Experiments with the ParaSol System
We present a novel adaptive synchronization algorithm, called the minimum average cost (MAC) algorithm, in the context of the ParaSol parallel simulation system. ParaSol is a mult...
Edward Mascarenhas, Felipe Knop, Vernon Rego
« Prev « First page 1649 / 1896 Last » Next »