1729 search results - page 163 / 346 » On Bounds for the k-Partitioning of Graphs |
177
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...
175
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...
180
click to vote
ESA
2004
Springer
15 years 12 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 ...
152
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
162
click to vote
ECCC
2006
15 years 6 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...