3415 search results - page 269 / 683 » Lower bounds on kernelization |
170
click to vote
JGT
2010
15 years 5 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
151
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
150
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
131
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
of Polyhedra: Limits of Abstraction Friedrich Eisenbrand∗ Nicolai Hähnle† Alexander Razborov‡ Thomas Rothvoߧ September 25, 2009 tigate the diameter of a natural abstract...
168
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Practical schemes for distributed video coding with side information at the decoder need to consider non-standard correlation models in order to take non-stationarities into accou...