Sciweavers

9507 search results - page 1472 / 1902
» Time-based language models
Sort
View
CSL
2006
Springer
15 years 10 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
ECOOP
2006
Springer
15 years 10 months ago
The Runtime Structure of Object Ownership
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
Nick Mitchell
EELC
2006
118views Languages» more  EELC 2006»
15 years 10 months ago
Lexicon Convergence in a Population With and Without Metacommunication
How does a shared lexicon arise in population of agents with differing lexicons, and how can this shared lexicon be maintained over multiple generations? In order to get some insig...
Zoran Macura, Jonathan Ginzburg
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 10 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
AINA
2003
IEEE
15 years 10 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu
« Prev « First page 1472 / 1902 Last » Next »