Sciweavers

1439 search results - page 117 / 288
» Fast approximation of centrality
Sort
View
132
Voted
HPDC
2007
IEEE
15 years 7 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
122
Voted
ICPR
2006
IEEE
15 years 6 months ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
Feng Tang, Hai Tao
98
Voted
KAIS
2006
126views more  KAIS 2006»
15 years 23 days ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
114
Voted
TROB
2008
118views more  TROB 2008»
15 years 21 days ago
A New Kalman-Filter-Based Framework for Fast and Accurate Visual Tracking of Rigid Objects
The best of Kalman-filter-based frameworks reported in the literature for rigid object tracking work well only if the object motions are smooth (which allows for tight uncertainty ...
Youngrock Yoon, Akio Kosaka, Avinash C. Kak
TMI
2010
123views more  TMI 2010»
14 years 11 months ago
Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren...