Sciweavers

6300 search results - page 23 / 1260
» We have it easy, but do we have it right
Sort
View
SACRYPT
2005
Springer
14 years 2 months ago
SPA Resistant Left-to-Right Integer Recodings
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
Nicolas Thériault
PVLDB
2008
182views more  PVLDB 2008»
13 years 8 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
KDD
2009
ACM
159views Data Mining» more  KDD 2009»
14 years 9 months ago
Adapting the right measures for K-means clustering
Clustering validation is a long standing challenge in the clustering literature. While many validation measures have been developed for evaluating the performance of clustering al...
Junjie Wu, Hui Xiong, Jian Chen
ICDE
2009
IEEE
140views Database» more  ICDE 2009»
13 years 6 months ago
Routing Questions to the Right Users in Online Communities
Online forums contain huge amounts of valuable user-generated content. In current forum systems, users have to passively wait for other users to visit the forum systems and read/an...
Yanhong Zhou, Gao Cong, Bin Cui, Christian S. Jens...
CTRSA
2005
Springer
78views Cryptology» more  CTRSA 2005»
14 years 2 months ago
New Minimal Weight Representations for Left-to-Right Window Methods
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
James A. Muir, Douglas R. Stinson