We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
—In this paper, the design, analysis, and development of a sixteen-legged palm-sized climbing robot using flat bulk tacky elastomer adhesives as an attachment method is presente...
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
— Humanoid robots are expected to share human environments in the future and it is important to ensure safety of their operation. A serious threat to safety is the fall of a huma...