1532 search results - page 118 / 307 » Connection Relations in Mereotopology |
184
click to vote
AISC
2010
Springer
15 years 11 months ago
2010
Springer
We provide a perspective on the current state and possible future of links between symbolic mathematical computing and artificial intelligence, on the occasion of the 10th biennial...
156
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
198
click to vote
ADBIS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
176
click to vote
NIPS
2008
15 years 7 months ago
2008
We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
168
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...