Sciweavers

28 search results - page 1 / 6
» Inexpensive d-dimensional matchings
Sort
View
RSA
2002
87views more  RSA 2002»
13 years 5 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
USENIX
2008
13 years 7 months ago
Fast, Inexpensive Content-Addressed Storage in Foundation
Foundation is a preservation system for users' personal, digital artifacts. Foundation preserves all of a user's data and its dependencies--fonts, programs, plugins, ker...
Sean C. Rhea, Russ Cox, Alex Pesterev
TITB
2010
167views Education» more  TITB 2010»
13 years 7 days ago
Structural action recognition in body sensor networks: distributed classification based on string matching
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subj...
Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari
ICBA
2004
Springer
143views Biometrics» more  ICBA 2004»
13 years 11 months ago
Externalized Fingerprint Matching
The 9/11 tragedy triggered an increased interest in biometric passports. According to several sources [2], the electronic ID market is expected to increase by more than 50% per ann...
Claude Barral, Jean-Sébastien Coron, David ...

Publication
7756views
15 years 4 months ago
A New Grey-Scale Template Image Matching Algorithm Using the Cross-Sectional Histogram Correlation Method
A new correlation technique for Grey-Scale Template Image Matching, the Cross-Sectional Histogram Correlation (CHC) Method, is proposed. In comparison to the traditional, widely-us...
Ryo Takei