4103 search results - page 199 / 821 » Some results on the Collatz problem |
186
click to vote
JDA
2006
15 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
161
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper a new rectification method is proposed. The method is both simple and efficient and can deal with all possible camera motions. A minimal image size without any pixel...
204
click to vote
GG
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
197
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
172
click to vote
JMIV
2006
15 years 6 months ago
2006
We propose a new method for the Lambertian Shape From Shading (SFS) problem based on the notion of Crandall-Lions viscosity solution. This method has the advantage of requiring the...