2374 search results - page 259 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
138
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
130
click to vote
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we address the impact of resource limitations on the operation and performance of the broadcasting and multicasting schemes developed for infrastructureless wireless...
121
click to vote
NIPS
2007
15 years 4 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
166
click to vote
COCO
1997
Springer
15 years 7 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
119
click to vote
COST
1994
Springer
15 years 7 months ago
1994
Springer
: An open architecture that achieves seamless binding between networking and multimedia devices is proposed. The building blocks of the binding architecture consist of a set of es,...