Sciweavers

11394 search results - page 474 / 2279
» Error-Correcting Data Structures
Sort
View
CCCG
2008
15 years 7 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
WSCG
2004
158views more  WSCG 2004»
15 years 7 months ago
JaGrLib: Library for Computer Graphics Education
This article describes JaGrLib
Josef Pelikán, Jan Kostlivý
ENTCS
2006
89views more  ENTCS 2006»
15 years 6 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
158
Voted
JMLR
2010
101views more  JMLR 2010»
15 years 1 months ago
Exploiting Feature Covariance in High-Dimensional Online Learning
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
CORR
2011
Springer
215views Education» more  CORR 2011»
15 years 26 days ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren