Sciweavers

1279 search results - page 185 / 256
» Fast Implementations of Automata Computations
Sort
View
CHI
2004
ACM
14 years 10 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman
SMA
2009
ACM
137views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Hierarchical molecular interfaces and solvation electrostatics
Electrostatic interactions play a significant role in determining the binding affinity of molecules and drugs. While significant effort has been devoted to the accurate computat...
Chandrajit L. Bajaj, Shun-Chuan Albert Chen, Guoli...
IPPS
2007
IEEE
14 years 4 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
PG
2007
IEEE
14 years 3 months ago
Exact Evaluation of Non-Polynomial Subdivision Schemes at Rational Parameter Values
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
Scott Schaefer, Joe D. Warren
ACCV
2006
Springer
14 years 3 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet