5100 search results - page 279 / 1020 » The Linear Complexity of a Graph |
146
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
137
click to vote
ICARCV
2006
IEEE
15 years 10 months ago
2006
IEEE
—A mini scale helicopter poses a difficult control problem due to its complex dynamics. Compared to its full-size counterparts, the model helicopter exhibits not only increased s...
140
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
129
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
122
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...