Sciweavers

2100 search results - page 150 / 420
» Fundamentals of the problem
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Fast inference and learning in large-state-space HMMs
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
Sajid M. Siddiqi, Andrew W. Moore
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 6 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ATAL
2009
Springer
16 years 22 days ago
Resource allocation with answer-set programming
Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of ...
João Leite, José Júlio Alfere...
ICASSP
2008
IEEE
16 years 18 days ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
155
Voted
SP
2006
IEEE
123views Security Privacy» more  SP 2006»
16 years 4 days ago
A Framework for the Evaluation of Intrusion Detection Systems
Classification accuracy in intrusion detection systems (IDSs) deals with such fundamental problems as how to compare two or more IDSs, how to evaluate the performance of an IDS, ...
Alvaro A. Cárdenas, John S. Baras, Karl Sea...