77 search results - page 15 / 16 » Extended Viterbi algorithm for optimized word HMMS |
161
click to vote
SPAA
1999
ACM
15 years 7 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
126
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
122
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
110
click to vote
MP
2006
15 years 3 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
135
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...