Sciweavers

502 search results - page 89 / 101
» On the Consistency of Bayesian Function Approximation Using ...
Sort
View
PPOPP
2011
ACM
12 years 10 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
FLAIRS
2004
13 years 9 months ago
Recurrent Neural Networks and Pitch Representations for Music Tasks
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
Judy A. Franklin
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
14 years 29 days ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac