2095 search results - page 78 / 419 » Improved pebbling bounds |
117
click to vote
ML
2007
ACM
15 years 6 days ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
107
Voted
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
100
Voted
SI3D
1999
ACM
15 years 5 months ago
1999
ACM
This paper presents a framework that uses the outputs of model simplification to guide the construction of bounding volume hierarchies for use in, for example, collision detection...
99
Voted
AAAI
1997
15 years 2 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
106
click to vote
DCC
2008
IEEE
16 years 9 days ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...