768 search results - page 87 / 154 » Asymptotic Cellular Complexity |
167
click to vote
SIAMJO
2008
15 years 5 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
318
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
142
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
134
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
152
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...