402 search results - page 27 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
ALIFE
2006
13 years 7 months ago
2006
One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have d...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Matrix factorization (MF) has been demonstrated to be one of the most competitive techniques for collaborative filtering. However, state-of-the-art MFs do not consider contextual...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
TNN
1998
13 years 7 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...