2452 search results - page 282 / 491 » The Case for Precision Sharing |
153
click to vote
MM
2000
ACM
15 years 11 months ago
2000
ACM
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
207
click to vote
ICALP
1993
Springer
15 years 10 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
161
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
184
click to vote
CODES
2007
IEEE
15 years 10 months ago
2007
IEEE
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
204
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Denial-of-service (DoS) attacks significantly degrade service quality experienced by legitimate users by introducing long delays, excessive losses, and service interruptions. The ...