Sciweavers

9849 search results - page 334 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
AAAI
2010
15 years 9 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
CCCG
2010
15 years 9 months ago
Computing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Stefan Huber, Martin Held
NAACL
2007
15 years 8 months ago
Clustered Sub-Matrix Singular Value Decomposition
This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. T...
Fang Huang, Yorick Wilks
EOR
2006
52views more  EOR 2006»
15 years 7 months ago
The joint replenishment problem with resource restriction
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
I. K. Moon, B. C. Cha
EOR
2006
70views more  EOR 2006»
15 years 7 months ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao