360 search results - page 50 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
120
Voted
KDD
2004
ACM
15 years 5 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
190
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...