4744 search results - page 55 / 949 » Connected Computing |
100
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
108
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
PERVASIVE
2004
Springer
15 years 5 months ago
2004
Springer
Much of the work on networking and communications is based on the premise that components interact in one of two ways: either they are connected via a stable wired or wireless netw...
ICPP
2003
IEEE
15 years 5 months ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...