1729 search results - page 139 / 346 » Bound Graph Polysemy |
149
click to vote
ICQNM
2007
IEEE
16 years 21 days ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
167
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
175
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
177
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...