Sciweavers

396 search results - page 64 / 80
» Exact Algorithms for Graph Homomorphisms
Sort
View
DAM
2002
135views more  DAM 2002»
13 years 8 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
14 years 3 months ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 10 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
GLOBECOM
2007
IEEE
14 years 3 months ago
Loss Tomography in General Topologies with Network Coding
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
Minas Gjoka, Christina Fragouli, Pegah Sattari, At...
CVPR
2010
IEEE
13 years 11 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai