Sciweavers

380 search results - page 17 / 76
» A Categorical Setting for Lower Complexity
Sort
View
MFCS
1997
Springer
15 years 1 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning
DAWAK
2011
Springer
13 years 9 months ago
OLAP Formulations for Supporting Complex Spatial Objects in Data Warehouses
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...
Ganesh Viswanathan, Markus Schneider
CORR
2011
Springer
207views Education» more  CORR 2011»
14 years 4 months ago
DB Category: Denotational Semantics for View-based Database Mappings
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
Zoran Majkic
FOCS
2005
IEEE
15 years 3 months ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
74
Voted
CVPR
2005
IEEE
15 years 11 months ago
A Bayesian Hierarchical Model for Learning Natural Scene Categories
We propose a novel approach to learn and recognize natural scene categories. Unlike previous work [9, 17], it does not require experts to annotate the training set. We represent t...
Fei-Fei Li 0002, Pietro Perona, California Institu...