Sciweavers

583 search results - page 78 / 117
» On small blocking sets and their linearity
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 10 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
JSA
2006
97views more  JSA 2006»
13 years 8 months ago
Dynamic feature selection for hardware prediction
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
Alan Fern, Robert Givan, Babak Falsafi, T. N. Vija...
WWW
2011
ACM
13 years 3 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
EMNLP
2007
13 years 10 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
CIARP
2007
Springer
14 years 2 months ago
Generalizing Dissimilarity Representations Using Feature Lines
A crucial issue in dissimilarity-based classification is the choice of the representation set. In the small sample case, classifiers capable of a good generalization and the inje...
Mauricio Orozco-Alzate, Robert P. W. Duin, C&eacut...