Sciweavers

2372 search results - page 296 / 475
» Probabilistic calling context
Sort
View
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 8 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
SOFSEM
2007
Springer
15 years 8 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
147
Voted
DCOSS
2006
Springer
15 years 6 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
UAI
2003
15 years 3 months ago
Preference-based Graphic Models for Collaborative Filtering
Collaborative filtering is a very useful general technique for exploiting the preference patterns of a group of users to predict the utility of items to a particular user. Previou...
Rong Jin, Luo Si, ChengXiang Zhai
DATAMINE
2006
130views more  DATAMINE 2006»
15 years 2 months ago
Mining Adaptive Ratio Rules from Distributed Data Sources
Different from traditional association-rule mining, a new paradigm called Ratio Rule (RR) was proposed recently. Ratio rules are aimed at capturing the quantitative association kno...
Jun Yan, Ning Liu, Qiang Yang, Benyu Zhang, QianSh...