Sciweavers

1517 search results - page 71 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
PARA
2000
Springer
15 years 8 months ago
GRISK: An Internet Based Search for K-Optimal Lattice Rules
Abstract. This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge correspondi...
Tor Sørevik, Jan Frode Myklebust
137
Voted
ICPR
2000
IEEE
16 years 5 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
197
Voted
TSE
2011
134views more  TSE 2011»
14 years 11 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
PDP
2008
IEEE
15 years 11 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
167
Voted
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 4 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...