Sciweavers

10608 search results - page 612 / 2122
» Complexity of O'Hara's Algorithm
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
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
ISI
2007
Springer
16 years 1 months ago
Using Digital Chains of Custody on Constrained Devices to Verify Evidence
—A digital chain of custody is an account documenting digital data at a particular place and time. This paper gives a method of validating and authenticating a digital chain of c...
Phillip G. Bradford, Daniel A. Ray
COMPGEOM
2004
ACM
16 years 19 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
16 years 13 days ago
Power-aware scheduling of conditional task graphs in real-time multiprocessor systems
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
Dongkun Shin, Jihong Kim