129 search results - page 12 / 26 » Average case analysis of the Boyer-Moore algorithm |
ENDM
2008
13 years 7 months ago
2008
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
—An omnidirectional mobile robot is able, kinematically, to move in any direction regardless of current pose. To date, nearly all designs and analyses of omnidirectional robots h...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
JSAC
2007
13 years 7 months ago
2007
— Despite its low-complexity, the zero-forcing receiver is known to suffer from noise enhancement to restore the spatially multiplexed data in a single-user MIMO system. Neverthe...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...