Sciweavers

811 search results - page 92 / 163
» When Novelty Is Not Enough
Sort
View
EUROCRYPT
1997
Springer
14 years 28 days ago
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals
We propose a concept for a worldwide information security infrastructure that protects law-abiding citizens, but not criminals, even if the latter use it fraudulently (i.e. when no...
Eric R. Verheul, Henk C. A. van Tilborg
LCPC
1994
Springer
14 years 26 days ago
Minimal Data Dependence Abstractions for Loop Transformations
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
Yi-Qing Yang, Corinne Ancourt, François Iri...
CIKM
2009
Springer
14 years 21 days ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
ECSQARU
2007
Springer
14 years 21 days ago
Conflict Analysis and Merging Operators Selection in Possibility Theory
In possibility theory, the degree of inconsistency is commonly used to measure the level of conflict in information from multiple sources after merging, especially conjunctive merg...
Weiru Liu
CINQ
2004
Springer
157views Database» more  CINQ 2004»
14 years 16 days ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut