2693 search results - page 215 / 539 » On Computing Complex Navigation Functions |
161
click to vote
COCO
2003
Springer
15 years 11 months 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} ...
182
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
151
click to vote
APPINF
2003
15 years 8 months ago
2003
This paper describes eight requirement indicators derived from a mobile work characterisation framework (MWCF). The MWCF is a framework for analysing mobile scenarios (mobile task...
174
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
183
click to vote
ICAC
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper proposes autonomic or organic computing principles to be applied to hardware design methods for future SoC solutions. Incorporating self-calibration, fault tolerance or...