Sciweavers

184 search results - page 14 / 37
» Querying Proofs
Sort
View
ECCC
2010
122views more  ECCC 2010»
13 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
DEXA
2007
Springer
107views Database» more  DEXA 2007»
13 years 11 months ago
When Mobile Objects' Energy Is Not So Tight: A New Perspective on Scalability Issues of Continuous Spatial Query Systems
The two dominant costs in continuous spatial query systems are the wireless communication cost for location update, and the evaluation cost for query processing. Existing works add...
Tai T. Do, Fuyu Liu, Kien A. Hua
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
TYPES
2004
Springer
14 years 10 days ago
A Content Based Mathematical Search Engine: Whelp
Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The ...
Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti...
LICS
1989
IEEE
13 years 11 months ago
Negation As Refutation
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
Melvin Fitting