1327 search results - page 223 / 266 » Path following algorithm for the graph matching problem |
101
click to vote
DIALM
2008
ACM
15 years 3 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
110
click to vote
WAW
2007
Springer
15 years 7 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
120
Voted
ISMM
2009
Springer
15 years 8 months 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 ...
122
click to vote
ISSS
1999
IEEE
15 years 6 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
COLING
2010
14 years 8 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...