Sciweavers

381 search results - page 8 / 77
» On the advantage over a random assignment
Sort
View
VTC
2007
IEEE
14 years 3 months ago
Time Slot Partitioning and Random Data Hopping for TDD Based Multihop Wireless Networks
Abstract— A multihop ad hoc wireless network with an interference avoidance model is analyzed for a time division duplex (TDD) air-interface. In accordance with the non-interfere...
Hrishikesh Venkataraman, Abdurazak Mudesir, Sinan ...
SIGIR
2008
ACM
13 years 9 months ago
Modeling expert finding as an absorbing random walk
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
FOCS
1999
IEEE
14 years 1 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
EUSFLAT
2007
117views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Transforming Probability Intervals into Other Uncertainty Models
Probability intervals are imprecise probability assignments over elementary events. They constitute a very convenient tool to model uncertain information : two common cases are co...
Sébastien Destercke, Didier Dubois, Eric Ch...
ICCV
2007
IEEE
14 years 11 months ago
Image Classification using Random Forests and Ferns
We explore the problem of classifying images by the object categories they contain in the case of a large number of object categories. To this end we combine three ingredients: (i...
Andrew Zisserman, Anna Bosch, Xavier Muñoz