848 search results - page 36 / 170 » Randomness and the linear degrees of computability |
136
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
SIAMREV
2010
14 years 6 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
104
click to vote
CCECE
2006
IEEE
15 years 5 months ago
2006
IEEE
This work is focused on the motion control of an underactuated brachiation robot with 3 links. We present the modeling of the dynamics of the robot and introduce the application o...
ECCC
2007
14 years 11 months ago
2007
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...