2853 search results - page 71 / 571 » Finding related tables |
SODA
1990
ACM
13 years 11 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
IJSS
2007
13 years 10 months ago
2007
— The purpose of this case study is to create a competitive operative management system for efficiency and quality performance for a company running maintenance service business ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Many applications need to segment out all small round
regions in an image. This task of finding dots can be viewed
as a region segmentation problem where the dots form one
regio...
FSE
2006
Springer
14 years 1 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...