COCO
2007
Springer
13 years 11 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, Cramer-Rao lower bounds (CRLBs) for estimation of vital signal parameters, such as respiration and heart-beat rates, using ultra-wideband (UWB) pulses are derive...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper relates 5 observability indexes for robot calibration to the “alphabet optimalities” from the experimental design literature. These 5 observability indexes are s...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...