Sciweavers

8728 search results - page 327 / 1746
» On Reduct Construction Algorithms
Sort
View
ACL
1990
15 years 8 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
ECCC
2006
112views more  ECCC 2006»
15 years 6 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
141
Voted
PPOPP
2010
ACM
16 years 4 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
TASLP
2002
99views more  TASLP 2002»
15 years 6 months ago
Speech pause detection for noise spectrum estimation by tracking power envelope dynamics
A speech pause detection algorithm is an important and sensitive part of most single-microphone noise reduction schemes for enhancement of speech signals corrupted by additive nois...
M. Marzinzik, Birger Kollmeier
ICDE
2000
IEEE
95views Database» more  ICDE 2000»
16 years 8 months ago
Dynamic Histograms: Capturing Evolving Data Sets
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
Donko Donjerkovic, Yannis E. Ioannidis, Raghu Rama...