Sciweavers

487 search results - page 95 / 98
» Integral Invariant Signatures
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
SMI
2008
IEEE
198views Image Analysis» more  SMI 2008»
14 years 4 months ago
Anisotropic geodesic distance computation for parametric surfaces
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper ...
Joon-Kyung Seong, Won-Ki Jeong, Elaine Cohen
WACV
2005
IEEE
14 years 3 months ago
Deformation Analysis for 3D Face Matching
Current two-dimensional image based face recognition systems encounter difficulties with large facial appearance variations due to the pose, illumination and expression changes. ...
Xiaoguang Lu, Anil K. Jain
KBSE
2003
IEEE
14 years 3 months ago
Tool-Assisted Unit Test Selection Based on Operational Violations
Unit testing, a common step in software development, presents a challenge. When produced manually, unit test suites are often insufficient to identify defects. The main alternativ...
Tao Xie, David Notkin
HYBRID
2010
Springer
14 years 2 months ago
Safe compositional network sketches: formal framework
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch assists system integr...
Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Mi...