5128 search results - page 118 / 1026 » Discrete Component Analysis |
148
click to vote
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
99
Voted
ICCAD
2006
IEEE
16 years 5 days ago
2006
IEEE
This paper presents figures of merit and error formulae to determine which interconnects require volume discretization in the GHZ range. Most of the previous work focused mainly o...
135
click to vote
DAGM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...
119
click to vote
RE
1999
Springer
15 years 7 months ago
1999
Springer
Developing requirements for software components, and ensuring these requirements are met by component designs, is very challenging, as very often application domain and stakeholde...