134 search results - page 3 / 27 » An Heuristic for the Construction of Intersection Graphs |
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
ASPDAC
2004
ACM
13 years 11 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
MICCAI
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
FLAIRS
2006
13 years 7 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
IJCAI
2007
13 years 7 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...