Sciweavers

1985 search results - page 65 / 397
» Multiresolution Analysis of Connectivity
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
DCOSS
2006
Springer
13 years 11 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
TIP
2008
85views more  TIP 2008»
13 years 7 months ago
A Scale-Based Connected Coherence Tree Algorithm for Image Segmentation
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
Jundi Ding, RuNing Ma, Songcan Chen
CCR
2011
13 years 2 months ago
Two-way TCP connections: old problem, new insight
Many papers explain the drop of download performance when two TCP connections in opposite directions share a common bottleneck link by ACK compression, the phenomenon in which dow...
Martin Heusse, Sears A. Merritt, Timothy X. Brown,...