Sciweavers

255 search results - page 12 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
IPSN
2009
Springer
14 years 2 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
IJAR
2008
82views more  IJAR 2008»
13 years 7 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
POPL
2003
ACM
14 years 7 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili
DAWAK
2006
Springer
13 years 11 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin