2127 search results - page 42 / 426 » Computing large matchings fast |
144
click to vote
ANOR
2008
15 years 5 months ago
2008
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
152
click to vote
WECWIS
2007
IEEE
15 years 11 months ago
2007
IEEE
With the growing number and ubiquitous usage of Web services throughout the service-oriented community, the need to find service descriptions in a given repository, as well as co...
153
click to vote
PAMI
2010
15 years 4 months ago
2010
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
138
Voted
DATAMINE
2006
15 years 5 months ago
2006
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
144
click to vote
IPPS
2007
IEEE
15 years 12 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...