Sciweavers

1449 search results - page 195 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 3 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
TMI
2011
127views more  TMI 2011»
15 years 1 months ago
Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...
IACR
2011
155views more  IACR 2011»
14 years 5 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 6 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 7 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...