1722 search results - page 295 / 345 » On the sample mean of graphs |
107
Voted
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
104
Voted
ICSM
2002
IEEE
15 years 3 months ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
ICN
2009
Springer
15 years 2 months ago
2009
Springer
—Ever since Descartes introduced planar coordinate systems, visual representations of data have become a widely accepted way of describing scientific phenomena. Modern advances ...
DNA
2001
Springer
15 years 2 months ago
2001
Springer
The directed evolution of proteins, using an in vitro domainal shuffling strategy was proposed in (J. Kolkman and W. Stemmer, Nat. Biotech. 19, 423 (2001). Due to backhybridization...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...