Sciweavers

969 search results - page 18 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
14 years 1 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
WWW
2004
ACM
14 years 8 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 8 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...
HUC
2007
Springer
14 years 1 months ago
How Smart Homes Learn: The Evolution of the Networked Home and Household
Despite a growing desire to create smart homes, we know little about how networked technologies interact with a house’s infrastructure. In this paper, we begin to close this gap ...
Marshini Chetty, Ja-Young Sung, Rebecca E. Grinter