Sciweavers

459 search results - page 21 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
INFOCOM
2000
IEEE
14 years 1 days ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SIGSOFT
2008
ACM
14 years 8 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
ICML
2010
IEEE
13 years 8 months ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...
ICMCS
2005
IEEE
75views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Separation of Voice and Music by Harmonic Structure Stability Analysis
Separation of voice and music is an interesting but difficult problem. It is useful for many other researches such as audio content analysis. In this paper, the difference betwee...
Yungang Zhang, Changshui Zhang
TWC
2010
13 years 2 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim