635 search results - page 108 / 127 » Some Computational Problems Related to Pseudo-intents |
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
109
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
RECOMB
2002
Springer
16 years 4 days ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
114
click to vote
ICDCN
2009
Springer
15 years 6 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...