Sciweavers

725 search results - page 67 / 145
» heuristics 2010
Sort
View
CCGRID
2010
IEEE
15 years 1 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
103
Voted
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
128
Voted
ECAI
2010
Springer
15 years 1 months ago
Symmetries of Symmetry Breaking Constraints
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different s...
George Katsirelos, Toby Walsh
102
Voted
ICML
2010
IEEE
15 years 1 months ago
Hilbert Space Embeddings of Hidden Markov Models
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
Le Song, Sajid M. Siddiqi, Geoffrey J. Gordon, Ale...
73
Voted
CEC
2010
IEEE
15 years 22 days ago
Simulated Annealing for constructing binary covering arrays of variable strength
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
Jose Torres-Jimenez, Eduardo Rodriguez-Tello