11580 search results - page 43 / 2316 » Communication vs. Computation |
COCO
2003
Springer
14 years 29 days ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
FGCS
2008
13 years 7 months ago
2008
A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant progr...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper explores similarity criteria between non-rigid shapes. Broadly speaking, such criteria are divided into intrinsic and extrinsic, the first referring to the metric struc...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together po...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple...