604 search results - page 2 / 121 » The Hardness of Metric Labeling |
111
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
103
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
101
click to vote
JCO
2007
14 years 11 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...