Sciweavers

1813 search results - page 126 / 363
» Calculi of Approximation Spaces
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Dynamic topic models
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
David M. Blei, John D. Lafferty
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
COMPGEOM
2005
ACM
15 years 8 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
COMPUTING
2006
119views more  COMPUTING 2006»
15 years 6 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
AMAI
2010
Springer
15 years 3 months ago
Geometry of relative plausibility and relative belief of singletons
The study of the interplay between belief and probability can be posed in a geometric framework, in which belief and plausibility functions are represented as points of simplices i...
Fabio Cuzzolin