2370 search results - page 387 / 474 » The Characterization of Data-Accumulating Algorithms |
IJCV
2000
14 years 9 months ago
2000
Classical visual servoing techniques need a strong a priori knowledge of the shape and the dimensions of the observed objects. In this paper, we present how the 2 1/2 D visual serv...
ALGORITHMICA
1998
14 years 9 months ago
1998
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
DAM
1998
14 years 9 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
DM
1998
14 years 9 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
113
click to vote
TSMC
2002
14 years 9 months ago
2002
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...