Sciweavers

209 search results - page 14 / 42
» Randomized consensus algorithms over large scale networks
Sort
View
WSC
2001
13 years 10 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
CIKM
2008
Springer
13 years 10 months ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
CVPR
2009
IEEE
15 years 3 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)
INFOCOM
2006
IEEE
14 years 2 months ago
Looking at Large Networks: Coding vs. Queueing
— Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multi-hop netwo...
Sandeep Bhadra, Sanjay Shakkottai
INFOCOM
2007
IEEE
14 years 2 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...