2252 search results - page 336 / 451 » Lower Bounds for Dynamic Algorithms |
140
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
157
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
154
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
140
click to vote
ECCV
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In the matching tasks which form an integral part of all types of tracking and geometrical vision, there are invariably priors available on the absolute and/or relative i...
127
click to vote
TIT
2008
15 years 3 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...