Sciweavers

58 search results - page 7 / 12
» Merging the Results of Approximate Match Operations
Sort
View
CGF
2010
111views more  CGF 2010»
13 years 6 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
PODS
2012
ACM
281views Database» more  PODS 2012»
11 years 9 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
ICPR
2006
IEEE
14 years 7 months ago
A Non-Iterative Approach to Reconstruct Face Templates from Match Scores
Regeneration of biometric templates from match scores has security and privacy implications related to any biometric based authentication system. In this paper, we propose a novel...
Pranab Mohanty, Rangachar Kasturi, Sudeep Sarkar
CLEF
2010
Springer
13 years 7 months ago
A Textual-Based Similarity Approach for Efficient and Scalable External Plagiarism Analysis - Lab Report for PAN at CLEF 2010
In this paper we present an approach to detect external plagiarism based on textual similarity. This is an efficient and precise method that can be applied over large sets of docum...
Daniel Micol, Óscar Ferrández, Ferna...
EDBT
2009
ACM
117views Database» more  EDBT 2009»
13 years 10 months ago
Parsimonious temporal aggregation
Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instan...
Juozas Gordevicius, Johann Gamper, Michael H. B&ou...