1449 search results - page 30 / 290 » Self-Randomized Exponentiation Algorithms |
KR
2000
Springer
15 years 4 months ago
2000
Springer
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
109
click to vote
IPL
2010
14 years 11 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
107
Voted
VLDB
2002
ACM
15 years 3 days ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
98
Voted
DM
2002
15 years 9 days ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
MOC
2002
15 years 4 days ago
2002
Abstract. Solutions of the optimal control and H-control problems for nonlinear affine systems can be found by solving Hamilton-Jacobi equations. However, these first order nonline...