1566 search results - page 184 / 314 » On a Cone Covering Problem |
113
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
147
click to vote
ICML
2000
IEEE
15 years 8 months ago
2000
IEEE
We propose a new rule induction algorithm for solving classification problems via probability estimation. The main advantage of decision rules is their simplicity and good interp...
186
click to vote
ICCVW
1999
Springer
15 years 8 months ago
1999
Springer
This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the p...
132
click to vote
SOFSEM
1997
Springer
15 years 8 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
149
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...