77 search results - page 7 / 16 » Enumeration Reducibility with Polynomial Time Bounds |
144
click to vote
GLOBECOM
2006
IEEE
15 years 12 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 ...
175
click to vote
ECCV
2010
Springer
15 years 10 months 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...
206
Voted
SODA
2012
ACM
13 years 8 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...
153
click to vote
COCO
2009
Springer
16 years 11 days 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...
167
click to vote
FOCS
2009
IEEE
16 years 16 days 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...