1536 search results - page 60 / 308 » Approximately Dominating Representatives |
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 ...
109
click to vote
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
The wavelet transform hierarchically decomposes images with prescribed bases, while multilineal models search for optimal bases to adapt visual data. In this paper, we integrate t...
IPSN
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
117
click to vote
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
AAAI
1990
15 years 1 months ago
1990
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...