64 search results - page 11 / 13 » Approximability of Edge Matching Puzzles |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
NPAR
2004
ACM
14 years 1 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper introduces the Interlevel Product (ILP) which is a transform based upon the Dual-Tree Complex Wavelet. Coefficients of the ILP have complex values whose magnitudes indi...
ISDA
2009
IEEE
14 years 3 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...