Sciweavers

749 search results - page 130 / 150
» Combinatory Models and Symbolic Computation
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
CONCUR
1997
Springer
15 years 2 months ago
Modularity for Timed and Hybrid Systems
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
Rajeev Alur, Thomas A. Henzinger
ECCV
2010
Springer
15 years 3 hour ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
CORR
2006
Springer
111views Education» more  CORR 2006»
14 years 10 months ago
Raisonner avec des diagrammes : perspectives cognitives et computationnelles
ABSTRACT. Reasoning with diagrams: cognitive and computational perspectives. Diagrammatic, analogical or iconic representations are often contrasted with linguistic or logical repr...
Catherine Recanati
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 10 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt