4114 search results - page 191 / 823 » Efficient Algorithms for the 2-Center Problems |
149
click to vote
IEICET
2006
15 years 6 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...
184
click to vote
IS
2008
15 years 6 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...
145
click to vote
KAIS
2006
15 years 6 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...
146
click to vote
TPDS
2008
15 years 6 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
PODS
2006
ACM
16 years 6 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...