Sciweavers

1538 search results - page 125 / 308
» Relative Randomness and Cardinality
Sort
View
MOBIHOC
2009
ACM
15 years 10 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
15 years 10 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STACS
2005
Springer
15 years 3 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
COMPGEOM
1994
ACM
15 years 2 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 10 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky