5100 search results - page 216 / 1020 » The Linear Complexity of a Graph |
MVA
1998
15 years 1 months ago
1998
This paper describes a comparisonof the performance and usability of three Linear Processor Arrays for image processing purposes. The study covered the NEC IMAP-VISION card 1], th...
81
Voted
CORR
2006
Springer
15 years 18 days ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
85
Voted
MICS
2010
14 years 7 months ago
2010
This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
100
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
122
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...