343 search results - page 43 / 69 » On Making Directed Graphs Transitive |
120
click to vote
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
130
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
112
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper, an analysis of locally linear embedding (LLE) in the context of clustering is developed. As LLE conserves the local affine coordinates of points, shape protrusions ...
112
click to vote
ATVA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
133
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...