Sciweavers

10997 search results - page 1994 / 2200
» On the Structure of Complete Sets
Sort
View
OSDI
2004
ACM
16 years 29 days 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,...
201
Voted
VLDB
2007
ACM
122views Database» more  VLDB 2007»
16 years 27 days ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
16 years 25 days ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...
99
Voted
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 24 days ago
Inverting schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin
125
Voted
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 24 days 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
« Prev « First page 1994 / 2200 Last » Next »