Sciweavers

2254 search results - page 190 / 451
» Computing the minimal covering set
Sort
View
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
16 years 1 months ago
Sensitive state-space exploration
— In this paper, we describe a simulation-based approach to the verification of high dimensional nonlinear systems subject to disturbances and uncertainty in the initial conditi...
Thao Dang, Alexandre Donzé, Oded Maler, Noa...
RT
2005
Springer
16 years 3 days ago
Real Illumination from Virtual Environments
We introduce a method for actively controlling the illumination in a room so that it is consistent with a virtual world. In combination with a high dynamic range display, the syst...
Abhijeet Ghosh, Matthew Trentacoste, Helge Seetzen...
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
CVPR
2011
IEEE
15 years 2 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
CGF
2010
115views more  CGF 2010»
15 years 6 months ago
Closed-form Blending of Local Symmetries
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...
Deboshmita Ghosh, Nina Amenta, Michael M. Kazhdan