9842 search results - page 1545 / 1969 » The Complexity of the Matching-Cut Problem |
198
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
217
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
195
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
210
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
165
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
for a set of operating conditions and coating color formulations, undesirable phenomena like color spitting and coating ribs may be triggered in the Micro-nip during the coating pr...