Sciweavers

581 search results - page 95 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
CORR
2006
Springer
76views Education» more  CORR 2006»
15 years 1 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
Martin J. Wainwright
ISCC
2009
IEEE
158views Communications» more  ISCC 2009»
15 years 8 months ago
Connectivity and critical point behavior in mobile ad hoc and sensor networks
— A well-known approach to increase the resilience of mobile ad hoc networks (MANETs) and unstructured sensor networks is to ensure a network topology where there are at least k ...
Tae-Hoon Kim, David Tipper, Prashant Krishnamurthy
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 6 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 9 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
ANCS
2009
ACM
14 years 11 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...