Sciweavers

1161 search results - page 137 / 233
» Approximation schemes for clustering problems
Sort
View
HYBRID
2007
Springer
15 years 11 months ago
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
Alessandro Abate, Saurabh Amin, Maria Prandini, Jo...
200
Voted
AAAI
2007
15 years 8 months ago
Detection of Multiple Deformable Objects using PCA-SIFT
In this paper, we address the problem of identifying and localizing multiple instances of highly deformable objects in real-time video data. We present an approach which uses PCA-...
Stefan Zickler, Alexei A. Efros
168
Voted
NIPS
2007
15 years 7 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
JAT
2010
88views more  JAT 2010»
15 years 4 months ago
Cauchy biorthogonal polynomials
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
M. Bertola, M. Gekhtman, J. Szmigielski
ALT
2004
Springer
16 years 2 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster