Sciweavers

2767 search results - page 87 / 554
» Universal Exponentiation Algorithm
Sort
View
PAMI
2002
103views more  PAMI 2002»
14 years 9 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 4 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
DAM
2010
66views more  DAM 2010»
14 years 10 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
AAAI
2012
13 years 9 days ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
WAW
2004
Springer
124views Algorithms» more  WAW 2004»
15 years 3 months ago
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...