Sciweavers

1895 search results - page 189 / 379
» Modular Functional Descriptions
Sort
View
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
13 years 11 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
ISB
2002
140views more  ISB 2002»
13 years 7 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
SIGMOD
2003
ACM
119views Database» more  SIGMOD 2003»
14 years 8 months ago
Robust and Efficient Fuzzy Match for Online Data Cleaning
To ensure high data quality, data warehouses must validate and cleanse incoming data tuples from external sources. In many situations, clean tuples must match acceptable tuples in...
Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, R...
ECOWS
2007
Springer
14 years 2 months ago
A Framework for Dynamic Web Services Composition
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...
Freddy Lécué, Eduardo Silva, Lu&iacu...
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 1 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold