Sciweavers

631 search results - page 81 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 10 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
PG
2007
IEEE
14 years 4 months ago
Automatic Natural Video Matting with Depth
Video matting is the process of taking a sequence of frames, isolating the foreground, and replacing the background with something different in each frame. This is an under-constr...
Oliver Wang, Jonathan Finger, Qingxiong Yang, Jame...
ISCA
1994
IEEE
80views Hardware» more  ISCA 1994»
14 years 2 months ago
A Study of Single-Chip Processor/Cache Organizations for Large Numbers of Transistors
This paper presents an examination of different cache and processor configurations assuming transistor densities will continue to increase as they have in the past. While in the s...
Matthew K. Farrens, Gary S. Tyson, Andrew R. Plesz...
NIPS
1998
13 years 11 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
TCS
2010
13 years 8 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer