Sciweavers

2560 search results - page 511 / 512
» Contributions to zero-sum problems
Sort
View
CANDC
2011
ACM
13 years 9 months ago
Understanding exploratory creativity in a visual domain
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...
82
Voted
CCS
2011
ACM
13 years 9 months ago
SURF: detecting and measuring search poisoning
Search engine optimization (SEO) techniques are often abused to promote websites among search results. This is a practice known as blackhat SEO. In this paper we tackle a newly em...
Long Lu, Roberto Perdisci, Wenke Lee
IACR
2011
158views more  IACR 2011»
13 years 9 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...
IACR
2011
212views more  IACR 2011»
13 years 9 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
15 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran