Sciweavers

6365 search results - page 126 / 1273
» Fast Local Computation Algorithms
Sort
View
ISVC
2007
Springer
15 years 11 months ago
Real-Time 3D Face Tracking with Mutual Information and Active Contours
Abstract. We present a markerless real-time, model-based 3D face tracking methodology. The system combines two robust and complimentary optimization-based strategies, namely active...
Giorgio Panin, Alois Knoll
NPL
2006
130views more  NPL 2006»
15 years 4 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
CN
2006
82views more  CN 2006»
15 years 4 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
TSP
2008
98views more  TSP 2008»
15 years 4 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 6 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...