Sciweavers

562 search results - page 66 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
STACS
2007
Springer
15 years 3 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
CTCS
1989
Springer
15 years 1 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
BMCBI
2005
126views more  BMCBI 2005»
14 years 9 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois
ADBIS
2003
Springer
194views Database» more  ADBIS 2003»
15 years 3 months ago
Rule-Based Generation of XML DTDs from UML Class Diagrams
We present an approach of how to extract automatically an XML document structure from a conceptual data model that describes the content of a document. We use UML class diagrams as...
Thomas Kudrass, Tobias Krumbein
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 8 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...