Sciweavers

7930 search results - page 648 / 1586
» Greedy in Approximation Algorithms
Sort
View
TVCG
2012
216views Hardware» more  TVCG 2012»
13 years 9 months ago
AniPaint: Interactive Painterly Animation from Video
—This paper presents an interactive system for creating painterly animation from video sequences. Previous approaches to painterly animation typically emphasize either purely aut...
Peter O'Donovan, Aaron Hertzmann
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
210
Voted
CVPR
2006
IEEE
16 years 9 months ago
Efficient Nonparametric Belief Propagation with Application to Articulated Body Tracking
An efficient Nonparametric Belief Propagation (NBP) algorithm is developed in this paper. While the recently proposed nonparametric belief propagation algorithm has wide applicati...
Tony X. Han, Huazhong Ning, Thomas S. Huang
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 9 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 23 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...