Sciweavers

3096 search results - page 503 / 620
» The Generalized FITC Approximation
Sort
View
DIM
2008
ACM
13 years 12 months ago
Quantifying the security of preference-based authentication
We describe a technique aimed at addressing longstanding problems for password reset: security and cost. In our approach, users are authenticated using their preferences. Experime...
Markus Jakobsson, Liu Yang, Susanne Wetzel
ECCV
2008
Springer
13 years 12 months ago
Fourier Analysis of the 2D Screened Poisson Equation for Gradient Domain Problems
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...
Pravin Bhat, Brian Curless, Michael F. Cohen, C. L...
ICB
2007
Springer
188views Biometrics» more  ICB 2007»
13 years 12 months ago
Color Face Tensor Factorization and Slicing for Illumination-Robust Recognition
In this paper we present a face recognition method based on multiway analysis of color face images, which is robust to varying illumination conditions. Illumination changes cause l...
Yong-Deok Kim, Seungjin Choi
ICC
2007
IEEE
186views Communications» more  ICC 2007»
13 years 12 months ago
On Channel Coding Selection in Time-Slotted ALOHA Packetized Multiple-Access Systems Over Rayleigh Fading Channels
— In this paper, we consider the time-slotted ALOHA packetized multiple-access system where the transmission channels obey i.i.d (independent identically distributed) Rayleigh fa...
Chen Wei, Pingyi Fan, Khaled Ben Letaief
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 12 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen