Sciweavers

1632 search results - page 134 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ICASSP
2011
IEEE
14 years 7 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...
ICCBR
2005
Springer
15 years 9 months ago
Learning to Win: Case-Based Plan Selection in a Real-Time Strategy Game
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
David W. Aha, Matthew Molineaux, Marc J. V. Ponsen
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 8 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
VISSYM
2007
15 years 6 months ago
Multi-Resolution Techniques for Visual Exploration of Large Time-Series Data
Time series are a data type of utmost importance in many domains such as business management and service monitoring. We address the problem of visualizing large time-related data ...
Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobia...
231
Voted
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 4 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...