5144 search results - page 969 / 1029 » Enhancing Search with Structure |
132
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
135
click to vote
FOIS
2006
15 years 5 months ago
2006
The field of BioInformatics has become a major venue for the development and application of computational ontologies. Ranging from controlled vocabularies to annotation of experim...
110
click to vote
COLING
2000
15 years 5 months ago
2000
This paper describes algorithms and software developed to characterise and detect generic intelligent language-like features iu an input signal, using Natural Language Learning te...
148
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
155
click to vote
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...