4137 search results - page 202 / 828 » On the number of matchings of a tree |
156
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
142
click to vote
ACL
2000
15 years 8 months ago
2000
The paper develops a constraint-based theory of prosodic phrasing and prominence, based on an HPSG framework, with an implementation in ALE. Prominence and juncture are represente...
151
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
182
click to vote
PAAPP
1998
15 years 6 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
412
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...