2924 search results - page 565 / 585 » Lower Bounds in Distributed Computing |
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
As the consequence of semantic gap, visual similarity does not guarantee semantic similarity, which in general is conflicting with the inherent assumption of many generativebased ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
TWC
2008
13 years 7 months ago
2008
We explore tradeoffs between different reception strategies of multiple receive antennas in fading channels with co-channel interference (CCI). Our tradeoff analysis is based on ou...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...