Sciweavers

174 search results - page 4 / 35
» Practically Perfect
Sort
View
CIKM
2008
Springer
13 years 9 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
PIMRC
2008
IEEE
14 years 1 months ago
On the secrecy capacity of frequency-selective fading channels : A practical vandermonde precoding
We study the secrecy capacity of the frequency-selective wiretap channel. Assuming that a guard interval of L symbols is inserted to avoid the inter-block interference and these s...
Mari Kobayashi, Mérouane Debbah
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
14 years 2 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
PAKDD
2007
ACM
181views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Practical Issues on Privacy-Preserving Health Data Mining
Privacy-preserving data mining techniques could encourage health data custodians to provide accurate information for mining by ensuring that the data mining procedures and results ...
Huidong Jin
ASIACRYPT
2003
Springer
14 years 21 days ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...