Sciweavers

5169 search results - page 30 / 1034
» Locality approximation using time
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 7 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...
TVCG
2008
144views more  TVCG 2008»
13 years 7 months ago
Silhouette Smoothing for Real-Time Rendering of Mesh Surfaces
Coarse piecewise linear approximation of surfaces causes undesirable polygonal appearance of silhouettes. We present an efficient method for smoothing the silhouettes of coarse tri...
Lu Wang, Changhe Tu, Wenping Wang, Xiangxu Meng, B...
PLDI
2003
ACM
14 years 19 days ago
Predicting whole-program locality through reuse distance analysis
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
Chen Ding, Yutao Zhong
ECAI
2008
Springer
13 years 9 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo
GLVLSI
2003
IEEE
202views VLSI» more  GLVLSI 2003»
14 years 20 days ago
System level design of real time face recognition architecture based on composite PCA
Design and implementation of a fast parallel architecture based on an improved principal component analysis (PCA) method called Composite PCA suitable for real-time face recogniti...
Rajkiran Gottumukkal, Vijayan K. Asari