5100 search results - page 231 / 1020 » The Linear Complexity of a Graph |
95
Voted
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
A direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of ...
123
Voted
COCO
2004
Springer
15 years 6 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
129
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
114
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
DCG
2008
15 years 21 days ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...