5864 search results - page 1160 / 1173 » Can We Work around Numerical Methods |
BMCBI
2010
13 years 5 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
SIAMMAX
2010
13 years 3 months ago
2010
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...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
SIAMCOMP
2002
13 years 8 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
The idea of representing images using a bag of visual words is currently popular in object category recognition. Since this representation is typically constructed using unsupervi...