2095 search results - page 131 / 419 » Improved pebbling bounds |
155
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
159
click to vote
TCS
2008
15 years 6 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
179
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--In this paper, we (1) provide a complete framework for classification using Variational Mixture of Experts (VME); (2) derive the variational lower bound; and (3) apply th...
155
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
167
click to vote
STOC
1989
ACM
15 years 10 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...