Sciweavers

1873 search results - page 365 / 375
» Camera Center Estimation
Sort
View
90
Voted
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
14 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
64
Voted
BMCBI
2008
102views more  BMCBI 2008»
14 years 10 months ago
Significance analysis of microarray for relative quantitation of LC/MS data in proteomics
Background: Although fold change is a commonly used criterion in quantitative proteomics for differentiating regulated proteins, it does not provide an estimation of false positiv...
Bryan A. P. Roxas, Qingbo Li
JCB
2006
115views more  JCB 2006»
14 years 10 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger