4112 search results - page 176 / 823 » Efficient Algorithms for the Spoonerism Problem |
121
click to vote
IEICET
2006
15 years 4 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
156
click to vote
IS
2008
15 years 4 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
115
click to vote
KAIS
2006
15 years 4 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
119
click to vote
TPDS
2008
15 years 4 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
158
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...