5214 search results - page 162 / 1043 » The Online Specialization Problem |
149
Voted
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
134
click to vote
IPMU
2010
Springer
15 years 6 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
132
click to vote
MVA
2008
15 years 4 months ago
2008
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
119
click to vote
SIAMSC
2008
15 years 4 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
114
click to vote
MP
2002
15 years 3 months ago
2002
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...