Sciweavers

1418 search results - page 191 / 284
» Schema polynomials and applications
Sort
View
SPIRE
1999
Springer
15 years 10 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
15 years 10 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
ICLP
1997
Springer
15 years 10 months ago
Total Homeostaticity and Integrity Constraints Restorability Recognition
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
Michael I. Dekhtyar, Alexander Ja. Dikovsky
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 10 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
ISCAS
1993
IEEE
105views Hardware» more  ISCAS 1993»
15 years 10 months ago
Maximally flat FIR filters
The existence of nonsymmetric generalized half-band lowpass and highpass FIR filters with maximally flat magnitude and group delay characteristics is proved. Like their linear-p...
Todor Cooklev, Akinori Nishihara