Sciweavers

8825 search results - page 91 / 1765
» All for one or one for all
Sort
View
BIOSIG
2009
136views Biometrics» more  BIOSIG 2009»
14 years 11 months ago
Tamper-proof and Privacy-protected Fingerprint Identification Systems
: In this paper alternatives of tamper-proof and privacy-protected biometric identification systems are shown. One approach to secure such databases is to use cryptography. With it...
Michael Schwaiger
FSS
2011
74views more  FSS 2011»
14 years 8 months ago
Ambiguous representations as fuzzy relations between sets
Crisp and L-fuzzy ambiguous representations of closed subsets of one space by closed subsets of another space are introduced. It is shown that, for each pair of compact Hausdorff ...
Oleh R. Nykyforchyn, Dusan Repovs
CORR
2011
Springer
171views Education» more  CORR 2011»
14 years 5 months ago
Orthogonal Range Searching on the RAM, Revisited
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RA...
Timothy M. Chan, Kasper Green Larsen, Mihai Patras...
ICASSP
2011
IEEE
14 years 5 months ago
Incorporating alignments into Conditional Random Fields for grapheme to phoneme conversion
Conditional Random Fields (CRFs) are a state-of-the-art approach to natural language processing tasks like grapheme-tophoneme (g2p) conversion which is used to produce pronunciati...
Patrick Lehnen, Stefan Hahn, Andreas Guta, Hermann...
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
16 years 1 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...