Sciweavers

6365 search results - page 845 / 1273
» Fast Local Computation Algorithms
Sort
View
AROBOTS
2010
101views more  AROBOTS 2010»
15 years 7 months ago
A quantitative assessment of structural errors in grid maps
Various common error sources affect the quality of a map, e.g., salt and pepper noise and other forms of noise that are more or less uniformly distributed over the map. But there ...
Andreas Birk
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 7 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 7 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
IJCV
2007
179views more  IJCV 2007»
15 years 7 months ago
A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching
Many vision applications require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most real-time stereo applications rely on local winner-takes-a...
Minglun Gong, Ruigang Yang, Liang Wang 0002, Mingw...
CAGD
2005
112views more  CAGD 2005»
15 years 7 months ago
Estimating differential quantities using polynomial fitting of osculating jets
This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is...
Frédéric Cazals, Marc Pouget