417 search results - page 32 / 84 » Some Theory for Generalized Boosting Algorithms |
214
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
122
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
123
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
117
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
135
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
We discuss information retrieval methods that aim at serving a diverse stream of user queries such as those submitted to commercial search engines. We propose methods that emphasi...