Sciweavers

853 search results - page 4 / 171
» Are many small sets explicitly small
Sort
View
TAL
2010
Springer
13 years 8 months ago
Summarization as Feature Selection for Document Categorization on Small Datasets
Abstract. Most common feature selection techniques for document categorization are supervised and require lots of training data in order to accurately capture the descriptive and d...
Emmanuel Anguiano-Hernández, Luis Villase&n...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 10 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
JCT
2011
90views more  JCT 2011»
13 years 4 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
EKAW
2010
Springer
13 years 8 months ago
How Much Semantic Data on Small Devices?
Abstract. Semantic tools such as triple stores, reasoners and query engines tend to be designed for large-scale applications. However, with the rise of sensor networks, smart-phone...
Mathieu d'Aquin, Andriy Nikolov, Enrico Motta
JMLR
2012
12 years 7 days ago
Domain Adaptation: A Small Sample Statistical Approach
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
Ruslan Salakhutdinov, Sham M. Kakade, Dean P. Fost...