Sciweavers

2834 search results - page 107 / 567
» Representing Trees with Constraints
Sort
View
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 10 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
14 years 1 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
ACL
1990
13 years 11 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
ACL
2009
13 years 8 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
ICRA
2010
IEEE
159views Robotics» more  ICRA 2010»
13 years 8 months ago
An RRT-based path planner for use in trajectory imitation
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...
Jonathan Claassens