Sciweavers

1403 search results - page 54 / 281
» Set cover algorithms for very large datasets
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 4 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
ICPR
2010
IEEE
14 years 10 months ago
Improved Mean Shift Algorithm with Heterogeneous Node Weights
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Ji Won Yoon, Simon P. Wilson
CVPR
2007
IEEE
15 years 11 months ago
Accurate, Dense, and Robust Multi-View Stereopsis
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
Yasutaka Furukawa, Jean Ponce
TVCG
2012
182views Hardware» more  TVCG 2012»
13 years 5 days ago
ISP: An Optimal Out-of-Core Image-Set Processing Streaming Architecture for Parallel Heterogeneous Systems
—Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution and disease of a population. However, these t...
Linh K. Ha, Jens Krüger, João Luiz Dih...
IDA
1997
Springer
15 years 1 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen