Sciweavers

2913 search results - page 255 / 583
» How Much to Copy
Sort
View
MMSEC
2005
ACM
131views Multimedia» more  MMSEC 2005»
15 years 10 months ago
Capacity of steganographic channels
—This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question a formal definition of st...
Jeremiah J. Harmsen, William A. Pearlman
AAIM
2005
Springer
75views Algorithms» more  AAIM 2005»
15 years 10 months ago
Mechanism Design for Set Cover Games When Elements Are Agents
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Ch...
IDA
2005
Springer
15 years 10 months ago
Exploring Hierarchical Rule Systems in Parallel Coordinates
Rule systems have failed to attract much interest in large data analysis problems because they tend to be too simplistic to be useful or consist of too many rules for human interpr...
Thomas R. Gabriel, A. Simona Pintilie, Michael R. ...
IDEAL
2005
Springer
15 years 10 months ago
Differential Priors for Elastic Nets
The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify...
Miguel Á. Carreira-Perpiñán, ...
IJCNLP
2005
Springer
15 years 10 months ago
Assigning Polarity Scores to Reviews Using Machine Learning Techniques
We propose a novel type of document classification task that quantifies how much a given document (review) appreciates the target object using not binary polarity (good or bad) b...
Daisuke Okanohara, Jun-ichi Tsujii