9842 search results - page 265 / 1969 » The Complexity of the Matching-Cut Problem |
136
click to vote
DAC
2000
ACM
16 years 1 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
97
Voted
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 7 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
88
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...