Sciweavers

333 search results - page 62 / 67
» Speeding up moving-target search
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
15 years 10 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
CHI
2010
ACM
15 years 5 months ago
Gazemarks: gaze-based visual placeholders to ease attention switching
Many tasks require attention switching. For example, searching for information on one sheet of paper and then entering this information onto another one. With paper we see that pe...
Dagmar Kern, Paul Marshall, Albrecht Schmidt
CAMP
2005
IEEE
15 years 3 months ago
Speeding-up NCC-Based Template Matching Using Parallel Multimedia Instructions
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...
Luigi di Stefano, Stefano Mattoccia, Federico Tomb...
PACT
2005
Springer
15 years 3 months ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann
RTSS
1992
IEEE
15 years 2 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin