Sciweavers

3110 search results - page 567 / 622
» On the initialization of the DNMF algorithm
Sort
View
CSCLP
2008
Springer
15 years 6 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 6 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
AAAI
2010
15 years 5 months ago
Automated Program Debugging Via Multiple Predicate Switching
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
Yongmei Liu, Bing Li
CCCG
2008
15 years 5 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
NIPS
2007
15 years 5 months ago
Evaluating Search Engines by Modeling the Relationship Between Relevance and Clicks
We propose a model that leverages the millions of clicks received by web search engines to predict document relevance. This allows the comparison of ranking functions when clicks ...
Ben Carterette, Rosie Jones