Sciweavers

5316 search results - page 370 / 1064
» Which Search Problems Are Random
Sort
View
218
Voted
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
16 years 11 min ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
SPAA
1990
ACM
15 years 11 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
WWW
2011
ACM
15 years 2 months ago
Characterizing search intent diversity into click models
Modeling a user’s click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examin...
Botao Hu, Yuchen Zhang, Weizhu Chen, Gang Wang, Qi...
CIKM
2007
Springer
16 years 1 months ago
Shine: search heterogeneous interrelated entities
Heterogeneous entities or objects are very common and are usually interrelated with each other in many scenarios. For example, typical Web search activities involve multiple types...
Xuanhui Wang, Jian-Tao Sun, Zheng Chen
WWW
2009
ACM
16 years 8 months ago
Efficient interactive fuzzy keyword search
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng