Sciweavers

329 search results - page 50 / 66
» An algorithm for recognition of n-collapsing words
Sort
View
AAAI
2000
15 years 1 months ago
Recognizing End-User Transactions in Performance Management
Providing good quality of service (e.g., low response times) in distributed computer systems requires measuring enduser perceptions of performance. Unfortunately, such measures ar...
Joseph L. Hellerstein, T. S. Jayram, Irina Rish
KDD
2010
ACM
326views Data Mining» more  KDD 2010»
14 years 10 months ago
Document clustering via dirichlet process mixture model with feature selection
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
Guan Yu, Ruizhang Huang, Zhaojun Wang
EMNLP
2010
14 years 10 months ago
Training Continuous Space Language Models: Some Practical Issues
Using multi-layer neural networks to estimate the probabilities of word sequences is a promising research area in statistical language modeling, with applications in speech recogn...
Hai Son Le, Alexandre Allauzen, Guillaume Wisniews...
WG
2007
Springer
15 years 6 months ago
Proper Helly Circular-Arc Graphs
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...
COLT
1995
Springer
15 years 3 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby