Sciweavers

214 search results - page 39 / 43
» Perfect and Almost Perfect Sequences
Sort
View
WWW
2011
ACM
13 years 2 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...
LOGCOM
2010
154views more  LOGCOM 2010»
13 years 2 months ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...
IPMI
2011
Springer
12 years 11 months ago
Fast Brain Matching with Spectral Correspondence
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
Herve Lombaert, Leo Grady, Jonathan R. Polimeni, F...
CCS
2008
ACM
13 years 9 months ago
A practical mimicry attack against powerful system-call monitors
System-call monitoring has become the basis for many hostbased intrusion detection as well as policy enforcement techniques. Mimicry attacks attempt to evade system-call monitorin...
Chetan Parampalli, R. Sekar, Rob Johnson
EACL
1993
ACL Anthology
13 years 9 months ago
A Computational Treatment of Sentence-Final 'then'
We describe a computational system which parses discourses consisting of sequences of simple sentences. These contain a range of temporal constructions, including time adverbials,...
Sheila Glasbey