Sciweavers

60 search results - page 8 / 12
» Random Order m-ary Exponentiation
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 11 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...
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 4 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
ICSM
2006
IEEE
14 years 3 months ago
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahda...
INFOCOM
2006
IEEE
14 years 3 months ago
Constant-Complexity Models for Wireless Channels
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
Syed A. Khayam, Hayder Radha
ASIACRYPT
2010
Springer
13 years 7 months ago
Leakage Resilient ElGamal Encryption
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
Eike Kiltz, Krzysztof Pietrzak