Sciweavers

176 search results - page 11 / 36
» Sorting and Selection with Random Costs
Sort
View
MST
1998
91views more  MST 1998»
13 years 7 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
ICMI
2003
Springer
99views Biometrics» more  ICMI 2003»
14 years 29 days ago
Selective perception policies for guiding sensing and computation in multimodal systems: a comparative analysis
Intensive computations required for sensing and processing perceptual information can impose significant burdens on personal computer systems. We explore several policies for sel...
Nuria Oliver, Eric Horvitz
WSC
1997
13 years 9 months ago
A Sortation System Model
Automotive manufacturing is a complex task involving several steps of machining and assembly. Typically, larger components of an automobile such as the body, engine etc. are assem...
Arun Jayaraman, Ramu Narayanaswamy, Ali K. Gunal
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud
DKE
2008
87views more  DKE 2008»
13 years 7 months ago
Region clustering based evaluation of multiple top-N selection queries
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
Liang Zhu, Weiyi Meng, Wenzhu Yang, Chunnian Liu