1321 search results - page 99 / 265 » Quadratic forms on graphs |
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
COMBINATORICS
2007
14 years 10 months ago
2007
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
ICALP
1990
Springer
15 years 1 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
113
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
104
click to vote
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...