Sciweavers

7930 search results - page 1173 / 1586
» Greedy in Approximation Algorithms
Sort
View
FLAIRS
2003
15 years 8 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
NIPS
2001
15 years 8 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
SIP
2001
15 years 8 months ago
Marching ridges
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
Jacob D. Furst, Stephen M. Pizer
IJCAI
2003
15 years 8 months ago
Logical Filtering
Filtering denotes any method whereby an agent updates its belief state—its knowledge of the state of the world—from a sequence of actions and observations. In logical filterin...
Eyal Amir, Stuart J. Russell
163
Voted
IJCAI
2003
15 years 8 months ago
Active Probing Strategies for Problem Diagnosis in Distributed Systems
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
Mark Brodie, Irina Rish, Sheng Ma, Natalia Odintso...
« Prev « First page 1173 / 1586 Last » Next »