Sciweavers

1957 search results - page 165 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
15 years 3 months ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 1 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
CP
2000
Springer
15 years 2 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
FOCM
2002
108views more  FOCM 2002»
14 years 9 months ago
Geometric Integration Algorithms on Homogeneous Manifolds
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
Debra Lewis, Peter J. Olver