4843 search results - page 736 / 969 » The Shortcut Problem - Complexity and Approximation |
158
Voted
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
126
click to vote
DAWAK
2001
Springer
15 years 8 months ago
2001
Springer
Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX q...
139
Voted
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
139
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
128
Voted
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...