Sciweavers

2827 search results - page 164 / 566
» Robustness of PSPACE-complete sets
Sort
View
127
Voted
JCSS
2000
121views more  JCSS 2000»
15 years 3 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
131
Voted
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 9 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
CG
2002
Springer
15 years 3 months ago
Shape reconstruction from partially missing data in modal space
To reconstruct the shape of objects from incomplete point sets or noisy images, robust and accurate reconstruction methods are required. This paper presents a physics-based approa...
Soo-Mi Choi, Myoung-Hee Kim
119
Voted
MOR
2008
94views more  MOR 2008»
15 years 3 months ago
Metastable Equilibria
We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local best-rep...
Srihari Govindan, Robert Wilson
141
Voted
CSDA
2007
103views more  CSDA 2007»
15 years 3 months ago
Cluster-wise assessment of cluster stability
Stability in cluster analysis is strongly dependent on the data set, especially on how well separated and how homogeneous the clusters are. In the same clustering, some clusters m...
Christian Hennig