Sciweavers

2421 search results - page 70 / 485
» Message from the Co-Chairs
Sort
View
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
13 years 2 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
PC
2011
318views Management» more  PC 2011»
13 years 2 months ago
High-performance message-passing over generic Ethernet hardware with Open-MX
In the last decade, cluster computing has become the most popular high-performance computing architecture. Although numerous technological innovations have been proposed to improv...
Brice Goglin
ICASSP
2011
IEEE
12 years 11 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama
CHI
2003
ACM
14 years 1 months ago
Kinetic typography-based instant messaging
Kinetic Typography, text whose appearance changes over time, is emerging as a new form of expression due to its ability to add emotional content to text. We explored the potential...
Kerry Bodine, Mathilde Pignol
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
14 years 1 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu