Sciweavers

282 search results - page 51 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
PREMI
2007
Springer
14 years 1 months ago
Self Adaptable Recognizer for Document Image Collections
Abstract. This paper presents an architecture that enables the recognizer to learn incrementally and, thereby adapt to document image collections for performance improvement. We ar...
Million Meshesha, C. V. Jawahar
IJCNN
2006
IEEE
14 years 1 months ago
Divide and Conquer Strategies for MLP Training
— Over time, neural networks have proven to be extremely powerful tools for data exploration with the capability to discover previously unknown dependencies and relationships in ...
Smriti Bhagat, Dipti Deodhare
TSP
2011
230views more  TSP 2011»
13 years 2 months ago
Bayesian Nonparametric Inference of Switching Dynamic Linear Models
—Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
ICPR
2004
IEEE
14 years 8 months ago
Switching Particle Filters for Efficient Real-time Visual Tracking
Particle filtering is an approach to Bayesian estimation of intractable posterior distributions from time series signals distributed by non-Gaussian noise. A couple of variant par...
Kenji Doya, Shin Ishii, Takashi Bando, Tomohiro Sh...