903 search results - page 20 / 181 » Non-well-founded trees in categories |
135
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
BIBE
2008
IEEE
15 years 1 months ago
2008
IEEE
We propose the use of formal ontological inferencing, rather than cladistics, to reconstruct phylogeny trees and to analyze the evolutionary relationships between species. For this...
106
click to vote
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
ACS
2008
14 years 12 months ago
2008
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...