9842 search results - page 73 / 1969 » The Complexity of the Matching-Cut Problem |
ORL
2008
13 years 7 months ago
2008
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
IEEEHPCS
2010
13 years 6 months ago
2010
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
AAAI
2006
13 years 9 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...