Sciweavers

429 search results - page 17 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
15 years 4 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
GLOBECOM
2007
IEEE
15 years 4 months ago
Improving Connectivity via Relays Deployment in Wireless Sensor Networks
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
COMPGEOM
1995
ACM
15 years 1 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
ICC
2011
IEEE
217views Communications» more  ICC 2011»
13 years 9 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue