796 search results - page 23 / 160 » Approximating the centroid is hard |
127
click to vote
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
111
click to vote
ECCC
2007
15 years 1 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
107
click to vote
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
As camera resolution increases, high-speed non-contact text capture through a digital camera is opening up a new channel for document capture and understanding. Unfortunately, per...
124
click to vote
TEC
2010
14 years 8 months ago
2010
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
123
click to vote
PATMOS
2007
Springer
15 years 8 months ago
2007
Springer
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...