Sciweavers

2944 search results - page 212 / 589
» Improving Bound Propagation
Sort
View
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
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...
Stasys Jukna
ICPR
2010
IEEE
15 years 4 months ago
Variational Mixture of Experts for Classification with Applications to Landmine Detection
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...
Seniha Esen Yuksel, Paul D. Gader
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 27 days ago
Maximum-Likelihood Decoding and Performance Analysis of a Noisy Channel Network with Network Coding
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
Ming Xiao, Tor M. Aulin
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 10 months ago
Optimal Size Integer Division Circuits
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...
John H. Reif, Stephen R. Tate
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
15 years 6 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...