218 search results - page 22 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
CIS
2004
Springer
14 years 1 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
IDA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
FOCS
1997
IEEE
13 years 12 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...