5100 search results - page 339 / 1020 » The Linear Complexity of a Graph |
179
click to vote
CVPR
2009
IEEE
17 years 7 days ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
276
click to vote
ISVC
2009
Springer
15 years 9 months ago
2009
Springer
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
150
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
174
Voted
ALGORITHMICA
2011
15 years 1 days ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
161
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...