Sciweavers

619 search results - page 39 / 124
» Random Bichromatic Matchings
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
IVC
2007
114views more  IVC 2007»
13 years 8 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
JCST
2008
102views more  JCST 2008»
13 years 8 months ago
Random and Periodic Sleep Schedules for Target Detection in Sensor Networks
Abstract--We study Random and Periodic sleep schedules from the point of view of delay in detecting the target. We consider sleep schedules in which a sensor in `inactive' mod...
Vaishali P. Sadaphal, Bijendra N. Jain
ICC
2008
IEEE
155views Communications» more  ICC 2008»
14 years 3 months ago
Adaptive Random Network Coding in WiMAX
—The IEEE 802.16 standard, or WiMAX, has emerged as one of the strongest contenders for broadband wireless access technology. In our previous work, we proposed a protocol using r...
Jin Jin, Baochun Li
FOCS
1989
IEEE
14 years 26 days ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel