Sciweavers

561 search results - page 66 / 113
» A Strategy for the Computation of Conditional Answers
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 9 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
PLDI
2005
ACM
14 years 2 months ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
CCR
2002
102views more  CCR 2002»
13 years 9 months ago
DNS performance and the effectiveness of caching
This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advance...
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert ...
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 9 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...