315 search results - page 25 / 63 » Better Approximation of Betweenness Centrality |
112
click to vote
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
116
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
134
click to vote
NIPS
2008
15 years 3 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
118
click to vote
DSN
2009
IEEE
15 years 8 months ago
2009
IEEE
Although server technology provides a means to support a wide range of online services and applications, their ad-hoc configuration poses significant challenges to the performan...
124
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...