Sciweavers

1871 search results - page 332 / 375
» The Ephemeral Pairing Problem
Sort
View
CCS
2008
ACM
15 years 1 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
87
Voted
CHI
2008
ACM
15 years 1 months ago
Implicit user-adaptive system engagement in speech and pen interfaces
As emphasis is placed on developing mobile, educational, and other applications that minimize cognitive load on users, it is becoming more essential to base interface design on im...
Sharon L. Oviatt, Colin Swindells, Alexander M. Ar...
IJCAI
2007
15 years 17 days ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan
IWEC
2007
15 years 16 days ago
Multi-track Scratch Player on a Multi-touch Sensing Device
Scratching with turntables is a popular sound generation technique in today’s music scene, especially in hip-hop culture. A conventional turntable system consists of two turntabl...
Kentaro Fukuchi
SIROCCO
2008
15 years 16 days ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker