Sciweavers

4949 search results - page 157 / 990
» Consistency and Set Intersection
Sort
View
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
15 years 9 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
15 years 9 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki
CONCUR
1997
Springer
15 years 8 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
FIWAC
1993
152views Cryptology» more  FIWAC 1993»
15 years 8 months ago
Disjoint Systems (Extended Abstract)
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
Noga Alon, Benny Sudakov
VLDB
1990
ACM
179views Database» more  VLDB 1990»
15 years 8 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish