Sciweavers

3172 search results - page 451 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CASES
2004
ACM
16 years 4 hour ago
Balancing design options with Sherpa
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
Timothy Sherwood, Mark Oskin, Brad Calder
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
16 years 1 hour ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu
SIGITE
2004
ACM
15 years 12 months ago
The use of MUPPETS in an introductory java programming course
“The Multi-User Programming Pedagogy for Enhancing Traditional Study” (MUPPETS) system has been under development at RIT for the last three years. This multi-user environment ...
Kevin J. Bierre, Andrew M. Phelps
CSL
2004
Springer
15 years 12 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
EMSOFT
2004
Springer
15 years 12 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras