Sciweavers

2693 search results - page 232 / 539
» On Computing Complex Navigation Functions
Sort
View
MST
1998
76views more  MST 1998»
15 years 6 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
FOCS
2007
IEEE
15 years 10 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
ICCV
2007
IEEE
16 years 8 months ago
Spherical-Homoscedastic Shapes
Shape analysis requires invariance under translation, scale and rotation. Translation and scale invariance can be realized by normalizing shape vectors with respect to their mean ...
Onur C. Hamsici, Aleix M. Martínez
SIGGRAPH
1994
ACM
15 years 10 months ago
Hierarchical spacetime control
Specifying the motion of an animated linked figure such that it achieves given tasks (e.g., throwing a ball into a basket) and performs the tasks in a realistic fashion (e.g., gra...
Zicheng Liu, Steven J. Gortler, Michael F. Cohen
DAC
2003
ACM
16 years 7 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...