Sciweavers

9997 search results - page 207 / 2000
» The case for crowd computing
Sort
View
ASIACRYPT
2010
Springer
15 years 2 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
CAP
2010
14 years 11 months ago
Accuracy versus time: a case study with summation algorithms
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
140
Voted
CVPR
2010
IEEE
15 years 4 months ago
High performance object detection by collaborative learning of Joint Ranking of Granules features
Object detection remains an important but challenging task in computer vision. We present a method that combines high accuracy with high efficiency. We adopt simplified forms of...
Chang Huang, Ramakant Nevatia
DAC
2007
ACM
16 years 5 months ago
Modeling the Function Cache for Worst-Case Execution Time Analysis
Static worst-case execution time (WCET) analysis is done by modeling the hardware behavior. In this paper we describe a WCET analysis technique to analyze systems with function ca...
Raimund Kirner, Martin Schoeberl
DAC
1998
ACM
16 years 5 months ago
A Case Study in Embedded System Design: An Engine Control Unit
A number of techniques and software tools for embedded system design have been recently proposed. However, the current practice in the designer community is heavily based on manua...
Alberto L. Sangiovanni-Vincentelli, Antonino Damia...