674 search results - page 114 / 135 » Arguments and Results |
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
TIT
2010
13 years 3 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
ANSS
2005
IEEE
14 years 2 months ago
2005
IEEE
The random trip model was recently proposed as a generic mobility model that contains many particular mobility models, including the widely-known random waypoint and random walks,...
FOCS
2004
IEEE
14 years 10 days ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...