Sciweavers

701 search results - page 90 / 141
» Self Bounding Learning Algorithms
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
CVPR
2009
IEEE
15 years 2 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
COMPGEOM
2005
ACM
13 years 9 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
SASO
2009
IEEE
14 years 2 months ago
Self-organizing Bandwidth Sharing in Priority-Based Medium Access
In this paper, we present an analysis of self-organizing bandwidth sharing in priority-based medium access. For this purpose, the priority-based Access Game is introduced. Analysi...
Stefan Wildermann, Tobias Ziermann, Jürgen Te...
MATES
2009
Springer
14 years 2 months ago
Towards a Taxonomy of Decision Making Problems in Multi-Agent Systems
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
Christian Guttmann