Sciweavers

255 search results - page 13 / 51
» Spanning Trees and Function Classes
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 15 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
DCG
2002
71views more  DCG 2002»
13 years 8 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
ICPR
2006
IEEE
14 years 9 months ago
Efficient Search and Verification for Function Based Classification from Real Range Images
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...
Ehud Rivlin, Ilan Shimshoni, Octavian Soldea
ITA
2007
101views Communications» more  ITA 2007»
13 years 8 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
IJCAI
1993
13 years 9 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga