Sciweavers

227 search results - page 44 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
91
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 11 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
GLOBECOM
2009
IEEE
15 years 3 months ago
Efficient Multicast Support in Buffered Crossbars using Networks on Chip
The Internet growth coupled with the variety of its services is creating an increasing need for multicast traffic support by backbone routers and packet switches. Recently, buffere...
Iria Varela Senin, Lotfi Mhamdi, Kees Goossens
CN
2007
111views more  CN 2007»
14 years 11 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
112
Voted
ECCB
2005
IEEE
15 years 4 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
112
Voted
ECCV
2002
Springer
16 years 29 days ago
Visual Data Fusion for Objects Localization by Active Vision
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
François Chaumette, Grégory Flandin