Sciweavers

1172 search results - page 148 / 235
» Approximate Reasoning Based on Similarity
Sort
View
FCT
2005
Springer
14 years 3 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
ICIP
2003
IEEE
14 years 3 months ago
Shape metrics, warping and statistics
We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and different...
Guillaume Charpiat, Olivier D. Faugeras, Renaud Ke...
CISS
2008
IEEE
14 years 5 days ago
On the frame error rate of transmission schemes on quasi-static fading channels
It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative d...
Ioannis Chatzigeorgiou, Ian J. Wassell, Rolando A....
MVA
2007
210views Computer Vision» more  MVA 2007»
13 years 11 months ago
Represent Image Contents Using Curves and Chain Code
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
Pornchai Mongkolnam, Chakarida Nukoolkit, Thanee D...
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 5 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...