Sciweavers

155 search results - page 23 / 31
» Fast matrix rank algorithms and applications
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
90
Voted
ICCV
2011
IEEE
13 years 9 months ago
A Theory of Coprime Blurred Pairs
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
Feng Li, Zijia Li, David Saunders, Jingyi Yu
CVPR
2005
IEEE
15 years 11 months ago
A Tensor Decomposition for Geometric Grouping and Segmentation
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
Venu Madhav Govindu
BMCBI
2010
104views more  BMCBI 2010»
14 years 9 months ago
A novel scoring function for discriminating hyperthermophilic and mesophilic proteins with application to predicting relative th
Background: The ability to design thermostable proteins is theoretically important and practically useful. Robust and accurate algorithms, however, remain elusive. One critical pr...
Yunqi Li, C. Russell Middaugh, Jianwen Fang
CIKM
2008
Springer
14 years 11 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...