12825 search results - page 14 / 2565 » Improved PLSOM algorithm |
101
Voted
IACR
2011
14 years 1 months ago
2011
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
124
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
107
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
115
Voted
IPCCC
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
134
Voted
ICIP
2004
IEEE
16 years 3 months ago
2004
IEEE
3D modeling of a free-form object involves the acquisition of multiple views (range images) of the object to cover its entire surface. These views are then registered in a common ...