Sciweavers

194 search results - page 16 / 39
» Better polynomials for GNFS
Sort
View
CIMAGING
2008
172views Hardware» more  CIMAGING 2008»
13 years 11 months ago
A generalization of non-local means via kernel regression
The Non-Local Means (NLM) method of denoising has received considerable attention in the image processing community due to its performance, despite its simplicity. In this paper, ...
Priyam Chatterjee, Peyman Milanfar
COMAD
2009
13 years 10 months ago
Trust-Based Infinitesimals for Enhanced Collaborative Filtering
In this paper we propose a novel recommender system which enhances user-based collaborative filtering by using a trust-based social network. Our main idea is to use infinitesimal ...
Maria Chowdhury, Alex Thomo, William W. Wadge
CP
2011
Springer
12 years 9 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
DSN
2002
IEEE
14 years 2 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman
EUROCRYPT
2010
Springer
14 years 2 months ago
A Simple BGN-Type Cryptosystem from LWE
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan