Sciweavers

9507 search results - page 1837 / 1902
» Time-based language models
Sort
View
JACM
2002
163views more  JACM 2002»
13 years 9 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
COMGEO
1999
ACM
13 years 9 months ago
Visualizing geometric algorithms over the Web
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...
James E. Baker, Isabel F. Cruz, Giuseppe Liotta, R...
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 9 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
JOLLI
2010
142views more  JOLLI 2010»
13 years 8 months ago
Towards a Type-Theoretical Account of Lexical Semantics
After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montaguestyle sema...
Christian Bassac, Bruno Mery, Christian Retor&eacu...
JSYML
2010
107views more  JSYML 2010»
13 years 8 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
« Prev « First page 1837 / 1902 Last » Next »