1431 search results - page 219 / 287 » The complexity of random ordered structures |
141
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
133
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
139
click to vote
ACISICIS
2008
IEEE
15 years 5 months ago
2008
IEEE
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
156
Voted
PR
2008
15 years 2 months ago
2008
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
170
Voted
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...