229 search results - page 18 / 46 » Proving Bounds on Real-Valued Functions with Computations |
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
93
Voted
MST
2002
15 years 3 days ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
117
Voted
NIPS
2001
15 years 1 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
98
Voted
IJCV
2006
15 years 13 days ago
2006
In this paper, we propose a new variational model to segment an object belonging to a given shape space using the active contour method, a geometric shape prior and the Mumford-Sha...
91
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...