Sciweavers

143 search results - page 25 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
14 years 3 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 11 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
AH
2008
Springer
14 years 4 months ago
Collection Browsing through Automatic Hierarchical Tagging
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
Korinna Bade, Marcel Hermkes
SENSYS
2005
ACM
14 years 3 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
EUROCRYPT
2012
Springer
12 years 5 days ago
Property Preserving Symmetric Encryption
Abstract. Processing on encrypted data is a subject of rich investigation. Several new and exotic encryption schemes, supporting a diverse set of features, have been developed for ...
Omkant Pandey, Yannis Rouselakis