Sciweavers

1999 search results - page 151 / 400
» Dependently Typed Grammars
Sort
View
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 9 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
CVPR
2008
IEEE
15 years 8 months ago
Motion blur identification from image gradients
Restoration of a degraded image from motion blurring is highly dependent on the estimation of the blurring kernel. Most of the existing motion deblurring techniques model the blur...
Hui Ji, Chaoqiang Liu
ICDAR
2011
IEEE
14 years 6 months ago
Identification of Indic Scripts on Torn-Documents
—Questioned Document Examination processes often encompass analysis of torn documents. To aid a forensic expert, automatic classification of content type in torn documents might ...
Sukalpa Chanda, Katrin Franke, Umapada Pal
TPHOL
2005
IEEE
15 years 12 months ago
Verifying a Secure Information Flow Analyzer
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
David A. Naumann
DAPSYS
2004
Springer
15 years 11 months ago
Analysis of the Multi-Phase Copying Garbage Collection Algorithm
The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithm...
Norbert Podhorszki