1461 search results - page 279 / 293 » Complexity of Graph Covering Problems |
105
click to vote
PVM
1997
Springer
15 years 3 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
106
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
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...
110
click to vote
MM
2004
ACM
15 years 4 months ago
2004
ACM
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...
CGO
2008
IEEE
15 years 1 months ago
2008
IEEE
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
SIROCCO
2008
15 years 18 days ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...