Sciweavers

875 search results - page 80 / 175
» Linear Manifold Clustering
Sort
View
ECCV
2010
Springer
15 years 5 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
108
Voted
TSMC
2010
14 years 7 months ago
Adaptive Appearance Model and Condensation Algorithm for Robust Face Tracking
We present an adaptive framework for condensation algorithms in the context of human-face tracking. We attack the face tracking problem by making factored sampling more efficient a...
Yui Man Lui, J. Ross Beveridge, L. Darrell Whitley
IPCCC
2007
IEEE
15 years 7 months ago
Scalable and Decentralized Content-Aware Dispatching in Web Clusters
— In this paper, we propose a novel and efficient content-aware dispatching algorithm. Our approach eliminates the potential bottleneck and the single point of failure problems ...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
WOWMOM
2005
ACM
109views Multimedia» more  WOWMOM 2005»
15 years 6 months ago
On Maximizing Lifetime of a Sensor Cluster
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
Samar Agnihotri, Pavan Nuggehalli, H. S. Jamadagni
114
Voted
CLUSTER
2007
IEEE
15 years 7 months ago
Satisfying your dependencies with SuperMatrix
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
Ernie Chan, Field G. Van Zee, Enrique S. Quintana-...