Sciweavers

971 search results - page 56 / 195
» Approximate Satisfiability and Equivalence
Sort
View
DGCI
2009
Springer
14 years 1 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
WSCG
2004
106views more  WSCG 2004»
13 years 11 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper
DCC
2011
IEEE
13 years 5 months ago
Deplump for Streaming Data
We present a general-purpose, lossless compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the infere...
Nicholas Bartlett, Frank Wood
CVPR
2007
IEEE
14 years 12 months ago
Symmetric Objects are Hardly Ambiguous
Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting...
Gaurav Aggarwal, Soma Biswas, Rama Chellappa
WWW
2005
ACM
14 years 10 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura