18 search results - page 2 / 4 » Polynomial Time Summary Statistics for Two general Classes o... |
APAL
2007
13 years 5 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
CGI
2009
IEEE
13 years 9 months ago
2009
IEEE
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...
FOCS
2008
IEEE
13 years 12 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...