Sciweavers

3656 search results - page 26 / 732
» Compact Location Problems
Sort
View
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
14 years 4 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
ICMCS
2007
IEEE
138views Multimedia» more  ICMCS 2007»
14 years 4 months ago
A Compact and Efficient Color Descriptor for Image Retrieval
— An important problem in color based image retrieval is the lack of efficient way to represent both the color and the spatial structure information with single descriptor. To so...
Ka-Man Wong, Lai-Man Po, Kwok-Wai Cheung
CVPR
2010
IEEE
13 years 12 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
PODC
2004
ACM
14 years 3 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
APIN
2002
70views more  APIN 2002»
13 years 9 months ago
Compact Unstructured Representations for Evolutionary Design
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
Hatem Hamda, François Jouve, Evelyne Lutton...