6105 search results - page 299 / 1221 » A Parallel Algorithm for Bound-Smoothing |
176
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
190
click to vote
HIPC
2003
Springer
15 years 12 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
195
click to vote
CCO
2001
Springer
15 years 11 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...
182
click to vote
JRTIP
2008
15 years 6 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...
182
click to vote
KDD
2009
ACM
15 years 11 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...