Sciweavers

3131 search results - page 82 / 627
» Generalized connection caching
Sort
View
NETWORKING
2004
13 years 10 months ago
Loss Strategies for Competing TCP/IP Connections
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its t...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
DM
2007
136views more  DM 2007»
13 years 8 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
WWW
2008
ACM
14 years 9 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
ICIP
2007
IEEE
14 years 3 months ago
Multifocus Image Fusion by Establishing Focal Connectivity
Multifocus fusion is the process of unifying focal information from a set of input images acquired with limited depth of field. In this effort, we present a general purpose multif...
Harishwaran Hariharan, Andreas Koschan, Mongi A. A...
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
14 years 3 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan