9842 search results - page 1359 / 1969 » The Complexity of the Matching-Cut Problem |
243
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
219
click to vote
WWW
2008
ACM
16 years 8 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
236
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
204
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
212
click to vote
INFOCOM
2005
IEEE
16 years 25 days ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...