Sciweavers

269 search results - page 46 / 54
» Optimal Randomized Algorithms for Local Sorting and Set-Maxi...
Sort
View
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 28 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
JPDC
2006
85views more  JPDC 2006»
13 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
AAAI
2008
13 years 9 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
IOPADS
1997
152views more  IOPADS 1997»
13 years 8 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia