Sciweavers

7106 search results - page 1121 / 1422
» Restricted Complexity, General Complexity
Sort
View
JBI
2006
117views Bioinformatics» more  JBI 2006»
15 years 6 months ago
Desiderata for domain reference ontologies in biomedicine
Domain reference ontologies represent knowledge about a particular part of the world in a way that is independent from specific objectives, through a theory of the domain. An exam...
Anita Burgun
JCST
2006
65views more  JCST 2006»
15 years 6 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ECCC
2007
123views more  ECCC 2007»
15 years 6 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
JIPS
2006
116views more  JIPS 2006»
15 years 6 months ago
A Method for Automatic Generation of OWL-S Service Ontology
: We present in this paper the methodology for automatic generation of OWL-S service model ontology along with the results and issues. First, we extract information related to atom...
Jin-Hyuk Yang, In-Jeong Chung
KES
2008
Springer
15 years 6 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
« Prev « First page 1121 / 1422 Last » Next »