Sciweavers

807 search results - page 83 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
EMNLP
2004
15 years 5 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
122
Voted
ROBOTICA
2002
112views more  ROBOTICA 2002»
15 years 3 months ago
Adaptation of Lowe's camera pose recovery algorithm to mobile robot self-localisation
: This paper presents an adaptation of Lowe's numerical model-based camera localisation algorithm to the domain of indoor mobile robotics. While the original method is straigh...
Omar Ait-Aider, Philippe Hoppenot, Etienne Colle
205
Voted
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 3 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
132
Voted
TSMC
2008
100views more  TSMC 2008»
15 years 3 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
121
Voted
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 3 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer