Sciweavers

3820 search results - page 715 / 764
» Bounded Model Debugging
Sort
View
IICAI
2007
13 years 11 months ago
Logics for Action
Logics of action, for reasoning about the effects of state change, and logics of belief, accounting for belief revision and update, have much in common. Furthermore, we may underta...
Michael P. Fourman
NIPS
2007
13 years 11 months ago
Receptive Fields without Spike-Triggering
Stimulus selectivity of sensory neurons is often characterized by estimating their receptive field properties such as orientation selectivity. Receptive fields are usually deriv...
Jakob Macke, Guenther Zeck, Matthias Bethge
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
AAAI
2006
13 years 11 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
SGP
2003
13 years 11 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat