4112 search results - page 327 / 823 » Efficient Algorithms for the Spoonerism Problem |
202
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
155
click to vote
VTC
2006
IEEE
16 years 26 days ago
2006
IEEE
There are several scheduling algorithms for Voice over IP (VoIP) services in IEEE 802.16e systems, such as unsolicited grant service (UGS), real-time polling service (rtPS), and ex...
180
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
184
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
200
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...