760 search results - page 85 / 152 » Algorithms for finding clique-transversals of graphs |
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
EMMCVPR
2007
Springer
14 years 24 days ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
SAC
2008
ACM
13 years 8 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
DGCI
2006
Springer
14 years 16 days ago
2006
Springer
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...