Sciweavers

138 search results - page 1 / 28
» The Complexity of Quickly ORM-Decidable Sets
Sort
View
CIE
2007
Springer
13 years 10 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...
CGO
2004
IEEE
13 years 8 months ago
VHC: Quickly Building an Optimizer for Complex Embedded Architectures
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
Michael Dupré, Nathalie Drach, Olivier Tema...
GRAPHICSINTERFACE
2009
13 years 2 months ago
QuickSelect: history-based selection expansion
When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting ...
Sara L. Su, Sylvain Paris, Frédo Durand
UIST
2010
ACM
13 years 2 months ago
UIMarks: quick graphical interaction with specific targets
This paper reports on the design and evaluation of UIMarks, a system that lets users specify on-screen targets and associated actions by means of a graphical marking language. UIM...
Olivier Chapuis, Nicolas Roussel
IJCNN
2007
IEEE
13 years 10 months ago
Daily Load Forecasting Using Quick Propagation Neural Network with a Special Holiday Encoding
— In the last decade, neural networks have been applied in Daily Load Forecasting. Nevertheless, two main problems are still present for using neural networks in this domain: fi...
Ivan Aquino, Cesar Oswaldo Perez Pinche, Jacquelin...