Sciweavers

1963 search results - page 94 / 393
» The Maximum Solution Problem on Graphs
Sort
View
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
14 years 2 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 2 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
14 years 4 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
ICALP
2000
Springer
14 years 1 months ago
Computing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Hristo Djidjev
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh