Sciweavers

1469 search results - page 95 / 294
» Approximate polynomial decomposition
Sort
View
ECIR
2006
Springer
14 years 11 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
TSP
2008
119views more  TSP 2008»
14 years 9 months ago
The Shiftable Complex Directional Pyramid - Part II: Implementation and Applications
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
Truong T. Nguyen, Soontorn Oraintara
CP
2008
Springer
14 years 11 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
UAI
1998
14 years 11 months ago
Context-specific approximation in probabilistic inference
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
David Poole
ICPR
2008
IEEE
15 years 11 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...