Sciweavers

1380 search results - page 124 / 276
» A General Polynomial Sieve
Sort
View
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 10 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 10 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
MOBIHOC
2008
ACM
14 years 9 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...
DCC
2005
IEEE
14 years 9 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
FOSSACS
2009
Springer
14 years 4 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...