3341 search results - page 503 / 669 » On Bounded Queries and Approximation |
201
click to vote
ICPADS
1994
IEEE
15 years 10 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
195
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
200
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
173
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
174
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...