3415 search results - page 250 / 683 » Lower bounds on kernelization |
190
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
175
click to vote
SIROCCO
2004
15 years 8 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
198
Voted
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
193
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
168
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...