Sciweavers

2597 search results - page 333 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
DCG
1998
53views more  DCG 1998»
15 years 6 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
IJCV
1998
135views more  IJCV 1998»
15 years 6 months ago
A Multibody Factorization Method for Independently Moving Objects
The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single mo...
João Paulo Costeira, Takeo Kanade
MLQ
2007
91views more  MLQ 2007»
15 years 6 months ago
Almost everywhere domination and superhighness
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
Stephen G. Simpson
PR
2008
170views more  PR 2008»
15 years 6 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
RSA
2008
94views more  RSA 2008»
15 years 6 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski