Sciweavers

7015 search results - page 342 / 1403
» Approximation algorithms for co-clustering
Sort
View
ECIR
2006
Springer
15 years 8 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
ICASSP
2010
IEEE
15 years 7 months ago
Approximate eigenvalue decomposition of para-Hermitian systems through successive FIR paraunitary transformations
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
Andre Tkacenko
CAD
2006
Springer
15 years 6 months ago
Cone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
Xunnian Yang, Weiping Yang
TCS
2008
15 years 6 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
VC
2008
138views more  VC 2008»
15 years 6 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh