16430 search results - page 409 / 3286 » On Computable Tree Functions |
189
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
162
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
197
click to vote
WAOA
2007
Springer
16 years 28 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
176
click to vote
GREC
2003
Springer
16 years 1 days ago
2003
Springer
We present a structural analysis method for the recognition of on-line handwritten mathematical expressions based on a minimum spanning tree construction and symbol dominance. The ...
164
click to vote
LISA
2001
15 years 8 months ago
2001
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...