237 search results - page 31 / 48 » Approximation Algorithms for Minimum Tree Partition |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
IJCAI
1993
13 years 10 months ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
VC
2010
13 years 7 months ago
2010
Abstract In this paper, we present a segmentation algorithm which partitions a mesh based on the premise that a 3D object consists of a core body and its constituent protrusible pa...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...