Search Sciweavers | Sciweavers

1639 search results - page 15 / 328

» Degree-constrained network flows

click to vote

LATIN
2010
Springer

162views Information Technology» more LATIN 2010»

Prize-Collecting Steiner Networks via Iterative Rounding

14 years 2 months ago

Download www-math.mit.edu

In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...

MohammadTaghi Hajiaghayi, Arefeh A. Nasri

claim paper

Read More »

click to vote

IJCV
2012

285views Computer Networks» more IJCV 2012»

Sparse Occlusion Detection with Optical Flow

12 years 7 days ago

Download www.vision.ucla.edu

Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reﬂection and static illumination, the task can be posed as a vari...

Alper Ayvaci, Michalis Raptis, Stefano Soatto

claim paper

Read More »

click to vote

TSP
2010

117views Artificial Intelligence» more TSP 2010»

Distributed detection of multi-hop information flows with fusion capacity constraints

13 years 4 months ago

Download acsp.ece.cornell.edu

The problem of detecting multi-hop information flows subject to communication constraints is considered. In a distributed detection scheme, eavesdroppers are deployed near nodes in...

Ameya Agaskar, Ting He, Lang Tong

claim paper

Read More »

click to vote

NETWORKS
2007

73views Computer Networks» more NETWORKS 2007»

Heuristic solutions for general concave minimum cost network flow problems

13 years 9 months ago

Download www.fep.up.pt

Dalila B. M. M. Fontes, José Fernando Gon&c...

claim paper

Read More »