145 search results - page 29 / 29 » Bipartite Graph Matching for Computing the Edit Distance of ... |
MOR
2010
13 years 4 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
ISMM
2009
Springer
14 years 4 days ago
2009
Springer
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
ICCV
2005
IEEE
13 years 11 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...