446 search results - page 73 / 90 » A Combinatorial Theorem for Trees |
157
click to vote
TACAS
2010
Springer
16 years 25 days ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
164
click to vote
STACS
2009
Springer
16 years 19 days ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
213
click to vote
FROCOS
2009
Springer
16 years 12 days ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
258
click to vote
PPSWR
2005
Springer
15 years 11 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
224
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...