Sciweavers

12194 search results - page 2030 / 2439
» Numberings Optimal for Learning
Sort
View
CHI
2007
ACM
16 years 8 months ago
"Jump and refine" for rapid pointing on mobile phones
Standard input devices for mobile phones are directional keys and discrete thumb-joysticks. These devices are dedicated to the discrete GUIs of the phones (eg. scroll lists and sm...
Martin Hachet, Joachim Pouderoux, Florence Tyndiuk...
HPCA
2003
IEEE
16 years 8 months ago
Exploring the VLSI Scalability of Stream Processors
Stream processors are high-performance programmable processors optimized to run media applications. Recent work has shown these processors to be more area- and energy-efficient th...
Brucek Khailany, William J. Dally, Scott Rixner, U...
POPL
2007
ACM
16 years 8 months ago
Lock allocation
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
Michael Emmi, Jeffrey S. Fischer, Ranjit Jhala, Ru...
CADE
2003
Springer
16 years 8 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 8 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
« Prev « First page 2030 / 2439 Last » Next »