Sciweavers

265 search results - page 42 / 53
» Using application domain ontology to construct an initial sy...
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 6 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
SIGADA
2004
Springer
14 years 1 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville
BMCBI
2006
122views more  BMCBI 2006»
13 years 7 months ago
A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
Holger Conzelmann, Julio Saez-Rodriguez, Thomas Sa...
DLS
2010
277views Languages» more  DLS 2010»
13 years 5 months ago
Factor: a dynamic stack-based programming language
Factor is a new dynamic object-oriented programming language. It began as an embedded scripting language and evolved to a mature application development language. The language has...
Sviatoslav Pestov, Daniel Ehrenberg, Joe Groff
WWW
2005
ACM
14 years 8 months ago
Ranking definitions with supervised learning methods
This paper is concerned with the problem of definition search. Specifically, given a term, we are to retrieve definitional excerpts of the term and rank the extracted excerpts acc...
Jun Xu, Yunbo Cao, Hang Li, Min Zhao