Sciweavers

141 search results - page 18 / 29
» Fast probabilistic snake algorithm
Sort
View
JMLR
2010
144views more  JMLR 2010»
14 years 4 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko
74
Voted
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 2 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
83
Voted
WG
1993
Springer
15 years 1 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
SRDS
2010
IEEE
14 years 7 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
ECCV
2008
Springer
15 years 11 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson