Sciweavers

2092 search results - page 353 / 419
» A Theory of Non-Deterministic Networks
Sort
View
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 11 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 11 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
15 years 8 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
15 years 8 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
CSCW
2010
ACM
15 years 8 months ago
Reading between the lines: linguistic cues to deception in online dating profiles
This study investigates whether deception in online dating profiles is detectable through a linguistic approach, which assumes that liars nonconsciously produce different word pat...
Catalina L. Toma, Jeffrey T. Hancock