Sciweavers

3715 search results - page 270 / 743
» A Space Optimization for FP-Growth
Sort
View
EMNLP
2007
15 years 8 months ago
Compressing Trigram Language Models With Golomb Coding
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
Kenneth Church, Ted Hart, Jianfeng Gao
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
JSCIC
2007
132views more  JSCIC 2007»
15 years 6 months ago
Minimal Stabilization for Discontinuous Galerkin Finite Element Methods for Hyperbolic Problems
We consider a discontinuous Galerkin finite element method for the advection–reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater t...
E. Burman, B. Stamm
TSMC
2002
119views more  TSMC 2002»
15 years 6 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
LOGCOM
2010
88views more  LOGCOM 2010»
15 years 5 months ago
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...