7129 search results - page 244 / 1426 » Approximation Algorithms for Treewidth |
146
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
136
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
122
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
156
click to vote
CIAC
2003
Springer
15 years 7 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
149
click to vote
ICCV
1995
IEEE
15 years 7 months ago
1995
IEEE
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...