6129 search results - page 276 / 1226 » A parallel LLL algorithm |
131
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
119
click to vote
JRTIP
2008
15 years 2 months ago
2008
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
126
click to vote
KDD
2009
ACM
15 years 7 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
139
Voted
DAC
2010
ACM
15 years 2 months ago
2010
ACM
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
129
Voted
OPODIS
2010
15 years 15 days ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...