385 search results - page 44 / 77 » A Fast Algorithm for Matrix Balancing |
253
click to vote
SDM
2011
SIAM
14 years 4 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
124
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
110
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
129
click to vote
SMA
2010
ACM
15 years 2 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
134
click to vote
IM
2007
15 years 1 months ago
2007
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...