Sciweavers

1773 search results - page 192 / 355
» The Visibility-Voronoi Complex and Its Applications
Sort
View
ICIAP
2005
ACM
16 years 6 months ago
A New Efficient Method for Producing Global Affine Invariants
This paper introduces a new efficient way for computing affine invariant features from gray-scale images. The method is based on a novel image transform which produces infinitely m...
Esa Rahtu, Janne Heikkilä, Mikko Salo
DCC
2006
IEEE
16 years 6 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
DCC
2005
IEEE
16 years 6 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
16 years 3 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 3 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...