Sciweavers

12052 search results - page 470 / 2411
» computing 2010
Sort
View
LATINCRYPT
2010
15 years 5 months ago
Fixed Argument Pairings
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
Craig Costello, Douglas Stebila
162
Voted
JMLR
2010
129views more  JMLR 2010»
15 years 1 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
JUCS
2010
95views more  JUCS 2010»
15 years 1 months ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
229
Voted
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
SIAMDM
2010
119views more  SIAMDM 2010»
15 years 1 months ago
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
Randy Cogill, Cheng Peng