402 search results - page 27 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
98
Voted
ESA
2010
Springer
15 years 1 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...
104
Voted
ALIFE
2006
15 years 15 days 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...
144
click to vote
SDM
2012
SIAM
13 years 2 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...
103
Voted
ICPR
2008
IEEE
15 years 6 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...
100
Voted
TNN
1998
15 years 2 days 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...