Sciweavers

4850 search results - page 830 / 970
» Proof and Computation in Geometry
Sort
View
SMI
2005
IEEE
16 years 2 days ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
APN
2005
Springer
16 years 1 days ago
Determinate STG Decomposition of Marked Graphs
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Mark Schäfer, Walter Vogler, Petr Jancar
HIP
2005
Springer
173views Cryptology» more  HIP 2005»
16 years 12 hour ago
Characters or Faces: A User Study on Ease of Use for HIPs
Web-based services designed for human users are being abused by computer programs (bots). This real-world issue has recently generated a new research area called Human Interactive...
Yong Rui, Zicheng Liu, Shannon Kallin, Gavin Janke...
ICALP
2005
Springer
16 years 11 hour ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
WIA
2005
Springer
15 years 12 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood