Sciweavers

167 search results - page 12 / 34
» On the complexity and approximation of syntenic distance
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Extraction of complex wavelet features for iris recognition
This paper presents a new feature extraction method for iris recognition. Since two dimensional complex wavelet transform (2D-CWT) does not only keep wavelet transform’s propert...
XiaoFu He, Pengfei Shi
WSCG
2004
185views more  WSCG 2004»
13 years 9 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 1 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 1 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle
FOCS
2007
IEEE
14 years 1 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis