914 search results - page 12 / 183 » Branch and Bound on the Network Model |
140
click to vote
TALG
2010
15 years 4 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
196
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
144
click to vote
GLOBECOM
2008
IEEE
16 years 14 days ago
2008
IEEE
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
181
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
143
click to vote
DSN
2005
IEEE
15 years 11 months ago
2005
IEEE
Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their enormous adverse impact on the Internet. There is a grea...