Sciweavers

5595 search results - page 456 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICASSP
2011
IEEE
14 years 11 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 7 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
ECML
2006
Springer
15 years 11 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
15 years 7 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
SOFSEM
2010
Springer
15 years 5 months ago
Approximate Structural Consistency
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
Michel de Rougemont, Adrien Vieilleribière