Sciweavers

5595 search results - page 758 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
VISUALIZATION
2000
IEEE
15 years 11 months ago
Constructing material interfaces from data sets with volume-fraction information
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
Kathleen S. Bonnell, Kenneth I. Joy, Bernd Hamann,...
CP
2000
Springer
15 years 11 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
151
Voted
STOC
1998
ACM
79views Algorithms» more  STOC 1998»
15 years 11 months ago
Multicasting in Heterogeneous Networks
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch S...
NIPS
2000
15 years 8 months ago
Using Free Energies to Represent Q-values in a Multiagent Reinforcement Learning Task
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
Brian Sallans, Geoffrey E. Hinton
171
Voted
ECCC
2007
185views more  ECCC 2007»
15 years 6 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan