Sciweavers

2913 search results - page 341 / 583
» How Much to Copy
Sort
View
120
Voted
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 10 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
156
Voted
AFRIGRAPH
2006
ACM
15 years 9 months ago
A GPU based saliency map for high-fidelity selective rendering
The computation of high-fidelity images in real-time remains one of the key challenges for computer graphics. Recent work has shown that by understanding the human visual system,...
Peter Longhurst, Kurt Debattista, Alan Chalmers
120
Voted
LOCA
2005
Springer
15 years 9 months ago
Classifying the Mobility of Users and the Popularity of Access Points
Abstract. There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of use...
Minkyong Kim, David Kotz
240
Voted
ADS
2004
Springer
15 years 9 months ago
A Categorical Annotation Scheme for Emotion in the Linguistic Content of Dialogue
Abstract. If we wish to implement dialogue systems which express emotion, dialogue corpora annotated for emotion would be a valuable resource. In order to develop such corpora we r...
Richard Craggs, Mary McGee Wood
118
Voted
ICALP
2003
Springer
15 years 9 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...