Sciweavers

374 search results - page 19 / 75
» Fast separable factorization and applications
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 2 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
JMLR
2006
131views more  JMLR 2006»
13 years 7 months ago
Incremental Support Vector Learning: Analysis, Implementation and Applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM ...
Pavel Laskov, Christian Gehl, Stefan Krüger, ...
IPPS
1997
IEEE
13 years 11 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
DKE
2006
67views more  DKE 2006»
13 years 7 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
MEMICS
2010
13 years 2 months ago
Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm
A topological flexibility of implicit active contours is of great benefit, since it allows simultaneous detection of several objects without any a priori knowledge about their num...
Martin Maska, Pavel Matula, Michal Kozubek