108 search results - page 17 / 22 » Zeta: A Global Method for Discretization of Continuous Varia... |
CVPR
2012
IEEE
13 years 5 days ago
2012
IEEE
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
FM
2001
Springer
15 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
101
click to vote
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we use the cumulative distribution of a random variable to define the information content in it and use it to develop a novel measure of information that parallels S...
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...