Sciweavers

1435 search results - page 122 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ACL
2007
14 years 11 months ago
Randomised Language Modelling for Statistical Machine Translation
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
David Talbot, Miles Osborne
RT
1999
Springer
15 years 2 months ago
Interactive Ray-Traced Scene Editing using Ray Segment Trees
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
Kavita Bala, Julie Dorsey, Seth J. Teller
KDD
2009
ACM
224views Data Mining» more  KDD 2009»
15 years 2 months ago
Issues in evaluation of stream learning algorithms
Learning from data streams is a research area of increasing importance. Nowadays, several stream learning algorithms have been developed. Most of them learn decision models that c...
João Gama, Raquel Sebastião, Pedro P...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 11 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ASPLOS
2008
ACM
14 years 12 months ago
Hardbound: architectural support for spatial safety of the C programming language
The C programming language is at least as well known for its absence of spatial memory safety guarantees (i.e., lack of bounds checking) as it is for its high performance. C'...
Joe Devietti, Colin Blundell, Milo M. K. Martin, S...