Sciweavers

NIPS
2007
13 years 10 months ago
Non-parametric Modeling of Partially Ranked Data
Statistical models on full and partial rankings of n items are often of limited practical use for large n due to computational consideration. We explore the use of non-parametric ...
Guy Lebanon, Yi Mao
NIPS
2007
13 years 10 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...
NIPS
2007
13 years 10 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
NIPS
2007
13 years 10 months ago
A Bayesian Framework for Cross-Situational Word-Learning
Michael Frank, Noah Goodman, Joshua B. Tenenbaum
NIPS
2007
13 years 10 months ago
Subspace-Based Face Recognition in Analog VLSI
We describe an analog-VLSI neural network for face recognition based on subspace methods. The system uses a dimensionality-reduction network whose coefficients can be either progr...
Gonzalo Carvajal, Waldo Valenzuela, Miguel Figuero...
NIPS
2007
13 years 10 months ago
Mining Internet-Scale Software Repositories
Large repositories of source code create new challenges and opportunities for statistical machine learning. Here we first develop Sourcerer, an infrastructure for the automated c...
Erik Linstead, Paul Rigor, Sushil Krishna Bajracha...
NIPS
2007
13 years 10 months ago
Inferring Elapsed Time from Stochastic Neural Processes
Many perceptual processes and neural computations, such as speech recognition, motor control and learning, depend on the ability to measure and mark the passage of time. However, ...
Misha Ahrens, Maneesh Sahani
NIPS
2007
13 years 10 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
NIPS
2007
13 years 10 months ago
Modelling motion primitives and their timing in biologically executed movements
Biological movement is built up of sub-blocks or motion primitives. Such primitives provide a compact representation of movement which is also desirable in robotic control applica...
Ben H. Williams, Marc Toussaint, Amos J. Storkey
NIPS
2007
13 years 10 months ago
Discriminative Batch Mode Active Learning
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...
Yuhong Guo, Dale Schuurmans