1380 search results - page 276 / 276 » A General Polynomial Sieve |
TASE
2010
IEEE
13 years 1 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
TIT
2010
13 years 1 days ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
STOC
2005
ACM
13 years 11 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
COCO
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...