Sciweavers

1172 search results - page 24 / 235
» Constructions of generalized Sidon sets
Sort
View
WWW
2011
ACM
14 years 6 months ago
Automatic construction of a context-aware sentiment lexicon: an optimization approach
The explosion of Web opinion data has made essential the need for automatic tools to analyze and understand people’s sentiments toward different topics. In most sentiment analy...
Yue Lu, Malú Castellanos, Umeshwar Dayal, C...
CIKM
2005
Springer
15 years 5 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
ML
2002
ACM
123views Machine Learning» more  ML 2002»
14 years 11 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein
DAM
2007
67views more  DAM 2007»
14 years 11 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh