Sciweavers

914 search results - page 21 / 183
» Informative performance metrics for dynamic optimisation pro...
Sort
View
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
PODS
1998
ACM
152views Database» more  PODS 1998»
14 years 29 days ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
HPCC
2007
Springer
14 years 2 months ago
DISH - Dynamic Information-Based Scalable Hashing on a Cluster of Web Cache Servers
Caching web pages is an important part of web infrastructure. The effects of caching services are even more pronounced for wireless infrastructures due to their limited bandwidth. ...
Andrew Sohn, Hukeun Kwak, Kyusik Chung
ECCC
2007
180views more  ECCC 2007»
13 years 8 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
INFOCOM
2003
IEEE
14 years 2 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan