Sciweavers

5100 search results - page 183 / 1020
» The Linear Complexity of a Graph
Sort
View
TIT
2010
98views Education» more  TIT 2010»
13 years 5 months ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff
CVPR
2012
IEEE
12 years 4 months ago
Branch-and-price global optimization for multi-view multi-object tracking
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn
PODC
2011
ACM
13 years 1 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
AUSAI
2005
Springer
14 years 4 months ago
Conditioning Graphs: Practical Structures for Inference in Bayesian Networks
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
Kevin Grant, Michael C. Horsch
COMSIS
2010
13 years 8 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys