Sciweavers

3208 search results - page 482 / 642
» A Lower Bound for Primality
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Quantization of Multiple Sources Using Integer Bit Allocation
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
Benjamin Farber, Kenneth Zeger
DCC
2005
IEEE
16 years 6 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 3 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 3 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ICS
2010
Tsinghua U.
16 years 3 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns