Sciweavers

7758 search results - page 357 / 1552
» On the Number of Distributive Lattices
Sort
View
AAAI
2007
15 years 9 months ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
15 years 6 months ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
176
Voted
ICML
2006
IEEE
16 years 7 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
IPPS
2003
IEEE
16 years 13 hour ago
Master-slave Tasking on Heterogeneous Processors
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
Pierre-François Dutot
CONCUR
2000
Springer
15 years 11 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky