315 search results - page 25 / 63 » Better Approximation of Betweenness Centrality |
NIPS
2007
13 years 11 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 ...
BMCBI
2010
13 years 10 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...
NIPS
2008
13 years 11 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...
DSN
2009
IEEE
14 years 4 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...
CDC
2009
IEEE
14 years 2 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...