Sciweavers

5316 search results - page 367 / 1064
» Which Search Problems Are Random
Sort
View
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
16 years 7 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...
ICASSP
2009
IEEE
16 years 2 months ago
Secure image retrieval through feature protection
This paper addresses the problem of image retrieval from an encrypted database, where data confidentiality is preserved both in the storage and retrieval process. The paper focus...
Wenjun Lu, Avinash L. Varna, Ashwin Swaminathan, M...
DEXA
2009
Springer
177views Database» more  DEXA 2009»
16 years 2 months ago
A Versatile Record Linkage Method by Term Matching Model Using CRF
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
165
Voted
ICASSP
2008
IEEE
16 years 1 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
CCS
2007
ACM
16 years 1 months ago
New constructions of fuzzy identity-based encryption
In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is indepe...
Joonsang Baek, Willy Susilo, Jianying Zhou