Sciweavers

381 search results - page 11 / 77
» On the advantage over a random assignment
Sort
View
JACM
2007
79views more  JACM 2007»
13 years 9 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
SIGIR
2009
ACM
14 years 3 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
CP
2006
Springer
14 years 27 days ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
ICIP
2003
IEEE
14 years 10 months ago
A novel cost-distortion optimization framework for video streaming over differentiated services networks
This paperpresentsa novel framework for streamingvideo over a Differentiated Services (DifPjew) network that jointly considers video source coding. packet classification and error...
Fan Zhai, Yiftach Eisenberg, Carlos E. Luna, Thras...
ICASSP
2008
IEEE
14 years 3 months ago
A weighted subspace approach for improving bagging performance
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
Qu-Tang Cai, Chun-Yi Peng, Chang-Shui Zhang