Sciweavers

3208 search results - page 304 / 642
» A Lower Bound for Primality
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 7 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
269
Voted
VLDB
2007
ACM
121views Database» more  VLDB 2007»
16 years 7 months ago
Ranked Subsequence Matching in Time-Series Databases
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Haifeng ...
MOBIHOC
2007
ACM
16 years 6 months ago
Capacity of multi-channel wireless networks with random (c, f) assignment
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
Vartika Bhandari, Nitin H. Vaidya
EWSN
2007
Springer
16 years 6 months ago
Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...
Pietro Ciciriello, Luca Mottola, Gian Pietro Picco
MOBIHOC
2004
ACM
16 years 6 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath