Sciweavers

994 search results - page 190 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
JMLR
2002
137views more  JMLR 2002»
13 years 6 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ACL
2010
13 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
PAMI
2006
187views more  PAMI 2006»
13 years 6 months ago
An Experimental Study on Pedestrian Classification
Detecting people in images is key for several important application domains in computer vision. This paper presents an in-depth experimental study on pedestrian classification; mul...
Stefan Munder, Dariu M. Gavrila
PEPM
1994
ACM
13 years 10 months ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...
JAIR
2011
134views more  JAIR 2011»
13 years 1 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...