Sciweavers

934 search results - page 86 / 187
» A theoretical analysis of the HIFF problem
Sort
View
ALT
2007
Springer
15 years 6 months ago
Tuning Bandit Algorithms in Stochastic Environments
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
Jean-Yves Audibert, Rémi Munos, Csaba Szepe...
ICALP
2004
Springer
15 years 3 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
EDCC
2005
Springer
15 years 3 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
IJCV
1998
238views more  IJCV 1998»
14 years 9 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
GECCO
2003
Springer
15 years 3 months ago
Hierarchical BOA Solves Ising Spin Glasses and MAXSAT
Abstract. Theoretical and empirical evidence exists that the hierarchical Bayesian optimization algorithm (hBOA) can solve challenging hierarchical problems and anything easier. Th...
Martin Pelikan, David E. Goldberg