7015 search results - page 226 / 1403 » Approximation algorithms for co-clustering |
227
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
284
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
180
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
177
click to vote
WAOA
2007
Springer
16 years 18 days 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...
168
click to vote
ISAAC
2003
Springer
15 years 11 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...