Sciweavers

100 search results - page 6 / 20
» In the Search of a Naive Type Theory
Sort
View
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 7 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik
LICS
2009
IEEE
14 years 2 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
WRLA
2010
13 years 5 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
Francisco Durán, José Meseguer
NIPS
2000
13 years 8 months ago
High-temperature Expansions for Learning Models of Nonnegative Data
Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
Oliver B. Downs
VL
1999
IEEE
134views Visual Languages» more  VL 1999»
13 years 11 months ago
Ambiguity in Visual Language Theory and Its Role in Diagram Parsing
To take advantage of the ever-increasing volume of diagrams in electronic form, it is crucial that we have methods for parsing diagrams. Once a structured, content-based descripti...
Robert P. Futrelle