Sciweavers

2774 search results - page 485 / 555
» Exploiting Deep Structure
Sort
View
OSDI
2004
ACM
16 years 4 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,...
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 4 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
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 4 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 4 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
EWSN
2010
Springer
16 years 1 months ago
Selective Reprogramming of Mobile Sensor Networks through Social Community Detection
Abstract. We target application domains where the behavior of animals or humans is monitored using wireless sensor network (WSN) devices. The code on these devices is updated frequ...
Bence Pásztor, Luca Mottola, Cecilia Mascol...