Sciweavers

4403 search results - page 245 / 881
» Galois Theory of Algorithms
Sort
View
MM
2005
ACM
103views Multimedia» more  MM 2005»
16 years 5 days ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 3 days ago
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
Xavier Dahan, Marc Moreno Maza, Éric Schost...
WADS
2005
Springer
133views Algorithms» more  WADS 2005»
16 years 3 days ago
Heap Building Bounds
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
Zhentao Li, Bruce A. Reed
ICAISC
2004
Springer
16 years 8 hour ago
Strategic Planning through Model Checking of ATL Formulae
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...
Wojciech Jamroga
COMPGEOM
2003
ACM
15 years 12 months ago
Morse-smale complexes for piecewise linear 3-manifolds
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
Herbert Edelsbrunner, John Harer, Vijay Natarajan,...