55 search results - page 7 / 11 » A time efficient Delaunay refinement algorithm |
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
We present an approach for efficiently recognizing all objects in a scene and estimating their full pose from multiple views. Our approach builds upon a state of the art single-vie...
88
Voted
VIS
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a novel approach for the direct computation of integral surfaces in general vector fields. As opposed to previous work, which we analyze in detail, our approach is based...
SIGGRAPH
1992
ACM
15 years 3 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
101
Voted
QEST
2010
IEEE
14 years 9 months ago
2010
IEEE
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
82
Voted
FUIN
2008
14 years 11 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...