Sciweavers

1528 search results - page 281 / 306
» On Signatures for Communication Graphs
Sort
View
SPAA
2006
ACM
14 years 2 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
IPPS
2005
IEEE
14 years 2 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
SAC
2005
ACM
14 years 2 months ago
Discovery and regeneration of hidden emails
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou, E...
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 2 months ago
Phrase structure detection in dance
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
Vidyarani M. Dyaberi, Hari Sundaram, Jodi James, G...
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 2 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...