Sciweavers

2373 search results - page 124 / 475
» On the Theory of Structural Subtyping
Sort
View
FUIN
2006
103views more  FUIN 2006»
15 years 6 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...

Lecture Notes
832views
17 years 4 months ago
Sorting and Searching Algorithms: A Cookbook
"This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know C...
THOMAS NIEMANN
CIKM
2008
Springer
15 years 8 months ago
A generative retrieval model for structured documents
Structured documents contain elements defined by the author(s) and annotations assigned by other people or processes. Structured documents pose challenges for probabilistic retrie...
Le Zhao, Jamie Callan
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
15 years 8 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
CONCUR
2004
Springer
15 years 12 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel