Sciweavers

917 search results - page 59 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ERSHOV
2003
Springer
15 years 3 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 2 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
CNL
2009
14 years 10 months ago
Controlled English Ontology-Based Data Access
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
Camilo Thorne, Diego Calvanese
CCECE
2006
IEEE
15 years 3 months ago
Survey of Biological High Performance Computing: Algorithms, Implementations and Outlook Research
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
Nasreddine Hireche, J. M. Pierre Langlois, Gabriel...
PAKDD
2011
ACM
419views Data Mining» more  PAKDD 2011»
14 years 17 days ago
DISC: Data-Intensive Similarity Measure for Categorical Data
Abstract. The concept of similarity is fundamentally important in almost every scientific field. Clustering, distance-based outlier detection, classification, regression and sea...
Aditya Desai, Himanshu Singh, Vikram Pudi