Sciweavers

725 search results - page 41 / 145
» Approximate Join Processing Over Data Streams
Sort
View
SSDBM
2007
IEEE
116views Database» more  SSDBM 2007»
14 years 3 months ago
A Distributed Algorithm for Joins in Sensor Networks
Given their autonomy, flexibility and large range of functionality, wireless sensor networks can be used as an effective and discrete means for monitoring data in many domains. T...
Alexandru Coman, Mario A. Nascimento
ICASSP
2010
IEEE
13 years 9 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
CLOUD
2010
ACM
14 years 1 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
14 years 8 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
COMAD
2008
13 years 10 months ago
Efficient Evaluation of Forward XPath Axes over XML Streams
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
Abdul Nizar, P. Sreenivasa Kumar