3415 search results - page 154 / 683 » Lower Bounds for Kernelizations |
117
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
182
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
180
Voted
IJCNN
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
128
Voted
PODC
1991
ACM
15 years 8 months ago
1991
ACM
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
130
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...