Sciweavers

146 search results - page 6 / 30
» Cyclic reference counting
Sort
View
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 11 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
AAAI
2011
12 years 9 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III
ECOOP
1998
Springer
14 years 1 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones
ALGOSENSORS
2007
Springer
14 years 3 months ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
LICS
2010
IEEE
13 years 8 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Martin Otto