Sciweavers

3495 search results - page 558 / 699
» On the random satisfiable process
Sort
View
KDD
2002
ACM
115views Data Mining» more  KDD 2002»
16 years 6 months ago
Collaborative crawling: mining user experiences for topical resource discovery
The rapid growth of the world wide web had made the problem of topic speci c resource discovery an important one in recent years. In this problem, it is desired to nd web pages wh...
Charu C. Aggarwal
OSDI
2004
ACM
16 years 6 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 6 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 6 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 6 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish