2192 search results - page 184 / 439 » Algorithms for Challenging Motif Problems |
116
click to vote
NIPS
2007
15 years 6 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
142
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
151
Voted
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
160
click to vote
TWC
2008
15 years 4 months ago
2008
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
127
Voted
AI
2000
Springer
15 years 4 months ago
2000
Springer
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...