77 search results - page 7 / 16 » Enumeration Reducibility with Polynomial Time Bounds |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
ECCV
2010
Springer
14 years 13 days ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
SODA
2012
ACM
11 years 10 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...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...