2434 search results - page 241 / 487 » Algorithmic Randomness of Closed Sets |
144
click to vote
NIPS
2000
15 years 5 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
149
click to vote
IJHIS
2007
15 years 4 months ago
2007
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
125
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
147
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
131
click to vote
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
15 years 6 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...