Sciweavers

439 search results - page 87 / 88
» Type invariants for Haskell
Sort
View
ERSHOV
2009
Springer
13 years 11 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
PR
2007
261views more  PR 2007»
13 years 7 months ago
Image registration by local histogram matching
We previously presented an image registration method, referred to hierarchical attribute matching mechanism for elastic registration (HAMMER), which demonstrated relatively high a...
Dinggang Shen
IMC
2010
ACM
13 years 5 months ago
Internet background radiation revisited
The monitoring of packets destined for reachable, yet unused, Internet addresses has proven to be a useful technique for measuring a variety of specific Internet phenomenon (e.g.,...
Eric Wustrow, Manish Karir, Michael Bailey, Farnam...