417 search results - page 81 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
BMCBI
2005
13 years 7 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
TCS
1998
13 years 7 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algor...