2127 search results - page 257 / 426 » Computing large matchings fast |
132
click to vote
CCGRID
2003
IEEE
15 years 9 months ago
2003
IEEE
High-performance peer-to-peer transfer between clusters will be fundamental technology base for various Grid middleware, such as large-scale data transfer in DataGrid settings, or...
126
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against ...
151
click to vote
SIAMSC
2008
15 years 3 months ago
2008
In a recent paper, the authors introduced the recovery method resp. local energy matching principle for solving large systems of lattice equations. The idea is to construct a part...
175
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
148
click to vote
WECWIS
2002
IEEE
15 years 9 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...