Sciweavers

9842 search results - page 1432 / 1969
» Compositional timing analysis
Sort
View
PODC
2006
ACM
16 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ECRTS
2005
IEEE
16 years 1 months ago
Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Antonio Martí Campoy, Isabelle Puaut, Angel...
IEEEPACT
2005
IEEE
16 years 1 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
VLDB
2004
ACM
186views Database» more  VLDB 2004»
16 years 23 days ago
Indexing Large Human-Motion Databases
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...
« Prev « First page 1432 / 1969 Last » Next »