Sciweavers

5115 search results - page 939 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
15 years 24 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TSP
2010
15 years 23 days ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
WWW
2007
ACM
16 years 6 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
CVPR
2007
IEEE
16 years 8 months ago
Two thresholds are better than one
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
Tao Zhang, Terrance E. Boult, R. C. Johnson
CVPR
2008
IEEE
16 years 8 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...