Sciweavers

5580 search results - page 630 / 1116
» Randomized priority algorithms
Sort
View
TSP
2011
165views more  TSP 2011»
14 years 11 months ago
Quaternion ICA From Second-Order Statistics
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
CVPR
2009
IEEE
16 years 12 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
WWW
2005
ACM
16 years 5 months ago
The volume and evolution of web page templates
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
David Gibson, Kunal Punera, Andrew Tomkins
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 5 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 5 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler