Sciweavers

1658 search results - page 225 / 332
» Learning Unknown Graphs
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers
ICCV
2007
IEEE
14 years 10 months ago
Toward Reconstructing Surfaces With Arbitrary Isotropic Reflectance : A Stratified Photometric Stereo Approach
We consider the problem of reconstructing the shape of a surface with an arbitrary, spatially varying isotropic bidirectional reflectance distribution function (BRDF), and introdu...
Neil G. Alldrin, David J. Kriegman
ICCV
1999
IEEE
14 years 10 months ago
Segmentation of Salient Closed Contours from Real Images
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
14 years 5 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 3 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara