9842 search results - page 108 / 1969 » The Complexity of the Matching-Cut Problem |
112
click to vote
IANDC
2010
15 years 1 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
114
Voted
PODC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
125
click to vote
COMPSEC
2010
15 years 1 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
146
click to vote
ICSOC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
153
Voted
PAMI
2011
14 years 6 months ago
2011
—3D object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail ...