Sciweavers

2593 search results - page 270 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
187
Voted
ACL
1994
15 years 8 months ago
Precise N-Gram Probabilities from Stochastic Context-Free Grammars
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
Andreas Stolcke, Jonathan Segal
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
16 years 1 months ago
STAGGER: Periodicity Mining of Data Streams Using Expanding Sliding Windows
Sensor devices are becoming ubiquitous, especially in measurement and monitoring applications. Because of the real-time, append-only and semi-infinite natures of the generated se...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
244
Voted
WOB
2004
233views Bioinformatics» more  WOB 2004»
15 years 8 months ago
Recent Advances in Gene Expression Data Clustering: A Case Study with Comparative Results
Several advanced techniques have been proposed for data clustering and many of them have been applied to gene expression data, with partial success. The high dimensionality and the...
George Barreto Bezerra, Geraldo M. A. Cança...
IPPS
2000
IEEE
15 years 11 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
ICA
2004
Springer
16 years 15 days ago
Blind Source Separation Using the Block-Coordinate Relative Newton Method
Presented here is a generalization of the modified relative Newton method, recently proposed in [1] for quasi-maximum likelihood blind source separation. Special structure of the ...
Alexander M. Bronstein, Michael M. Bronstein, Mich...