2107 search results - page 17 / 422 » Computing Small Search Numbers in Linear Time |
96
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
138
click to vote
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
135
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
121
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
167
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...