Sciweavers

1439 search results - page 58 / 288
» Fast approximation of centrality
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa
VISSYM
2003
14 years 11 months ago
ISOSLIDER: A System for Interactive Exploration of Isosurfaces
We present ISOSLIDER, a system for interactive exploration of isosurfaces of a scalar field. Our algorithm focuses on fast update of isosurfaces for interactive display as a user...
Jatin Chhugani, Sudhir Vishwanath, Jonathan D. Coh...
FOCS
2006
IEEE
15 years 3 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
RT
1999
Springer
15 years 2 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
AUSAI
2001
Springer
15 years 1 months ago
Fast Text Classification Using Sequential Sampling Processes
A central problem in information retrieval is the automated classification of text documents. While many existing methods achieve good levels of performance, they generally require...
Michael D. Lee