2693 search results - page 67 / 539 » On Computing Complex Navigation Functions |
STOC
1992
ACM
14 years 2 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
FSTTCS
1992
Springer
14 years 2 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
CW
2004
IEEE
14 years 1 months ago
2004
IEEE
Shared virtual worlds require exchanging shape models over the Internet. Since complex shapes such as VRML objects are often defined with polygonal meshes, the size of models may ...
3DPH
2009
13 years 7 months ago
2009
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...