663 search results - page 108 / 133 » A Parallel Algorithm for Enumerating Combinations |
131
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
104
Voted
CHES
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We propose a new technique called Differential Cluster Analysis for side-channel key recovery attacks. This technique uses cluster analysis to detect internal collisions ...
113
Voted
ICDCSW
2008
IEEE
15 years 8 months ago
2008
IEEE
—Recently, wireless sensor networks (WSNs) have been widely discussed in many applications. In this paper, we propose a WSN-based intelligent light control system for indoor envi...
131
click to vote
IEEEPACT
2008
IEEE
15 years 8 months ago
2008
IEEE
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
118
Voted
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...