9842 search results - page 391 / 1969 » The Complexity of the Matching-Cut Problem |
159
click to vote
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
158
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
137
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
132
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
150
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...