34 search results - page 3 / 7 » Characterizing and Computing Minimal Cograph Completions |
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
CVPR
2001
IEEE
14 years 7 months ago
2001
IEEE
In this paper we give a complete characterization of critical configurations for projective reconstruction with any number of points and views. A set of cameras and points is said...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We analyze a previously unexplored generalization of the scalar total variation to vector-valued functions, which is motivated by geometric measure theory. A complete mathematical...
BMCBI
2004
13 years 5 months ago
2004
Background: Oligonucleotide frequencies were shown to be conserved signatures for bacterial genomes, however, the underlying constraints have yet not been resolved in detail. In t...