Sciweavers

1019 search results - page 49 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ECCV
2004
Springer
14 years 10 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
CVPR
2006
IEEE
14 years 10 months ago
Hidden Conditional Random Fields for Gesture Recognition
We introduce a discriminative hidden-state approach for the recognition of human gestures. Gesture sequences often have a complex underlying structure, and models that can incorpo...
Sy Bor Wang, Ariadna Quattoni, Louis-Philippe More...
LFP
1990
73views more  LFP 1990»
13 years 9 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
INFOCOM
2007
IEEE
14 years 3 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...