Sciweavers

128 search results - page 5 / 26
» Lower bounds for adaptive collect and related objects
Sort
View
APPML
2006
73views more  APPML 2006»
13 years 7 months ago
Threshold arrangements and the knapsack problem
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
Günter Rote, André Schulz
TIT
2010
107views Education» more  TIT 2010»
13 years 2 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
TPDS
2008
176views more  TPDS 2008»
13 years 7 months ago
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks
Communication is a primary source of energy consumption in wireless sensor networks. Due to resource constraints, the sensor nodes may not have enough energy to report every readin...
Xueyan Tang, Jianliang Xu
IVC
2007
114views more  IVC 2007»
13 years 7 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
DC
2006
13 years 7 months ago
On the inherent weakness of conditional primitives
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
Faith Ellen Fich, Danny Hendler, Nir Shavit