Sciweavers

44 search results - page 6 / 9
» On basing one-way functions on NP-hardness
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 8 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 2 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
DIS
2007
Springer
14 years 2 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
ACTAC
2006
94views more  ACTAC 2006»
13 years 8 months ago
A Hierarchical Evaluation Methodology in Speech Recognition
In speech recognition vast hypothesis spaces are generated, so the search methods used and their speedup techniques are both of great importance. One way of getting a speedup gain...
Gábor Gosztolya, András Kocsor
LOBJET
2008
104views more  LOBJET 2008»
13 years 8 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte