3415 search results - page 259 / 683 » Lower bounds on kernelization |
174
click to vote
JCT
2007
15 years 6 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
192
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
187
click to vote
UAI
1992
15 years 7 months ago
1992
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
174
click to vote
COLT
2005
Springer
16 years 6 days ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
194
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...