Sciweavers

2127 search results - page 42 / 426
» Computing large matchings fast
Sort
View
125
Voted
ANOR
2008
93views more  ANOR 2008»
15 years 3 months ago
Pruning in column generation for service vehicle dispatching
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...
Stephan Westphal, Sven Oliver Krumke
129
Voted
WECWIS
2007
IEEE
135views ECommerce» more  WECWIS 2007»
15 years 9 months ago
Large Scale Web Service Discovery and Composition using High Performance In-Memory Indexing
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...
Lukasz Juszczyk, Anton Michlmayr, Christian Platze...
125
Voted
PAMI
2010
222views more  PAMI 2010»
15 years 1 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— 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...
Wanli Ouyang, Wai-kuen Cham
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 3 months ago
Computing LTS Regression for Large Data Sets
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...
Peter Rousseeuw, Katrien van Driessen
120
Voted
IPPS
2007
IEEE
15 years 9 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
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...
Samee Ullah Khan, Ishfaq Ahmad