12194 search results - page 207 / 2439 » cans 2010 |
DAM
2010
15 years 4 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
157
click to vote
DATAMINE
2010
15 years 4 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
113
click to vote
DCG
2010
15 years 4 months ago
2010
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
126
click to vote
DCG
2010
15 years 4 months ago
2010
We show that the cyclic lamplighter group C2 Cn embeds into Hilbert space with distortion O log n . This matches the lower bound proved by Lee, Naor and Peres in [14], answering a...
162
click to vote
DISOPT
2010
15 years 4 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...