464 search results - page 61 / 93 » Subsystem Based Generalizations of Rough Set Approximations |
104
click to vote
WSCG
2004
15 years 1 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
CGF
2005
14 years 11 months ago
2005
We propose statistical learning methods for approximating implicit surfaces and computing dense 3D deformation fields. Our approach is based on Support Vector (SV) Machines, which...
QEST
2005
IEEE
15 years 5 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
NIPS
2007
15 years 1 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...