759 search results - page 111 / 152 » Optimal Graph Search with Iterated Graph Cuts |
ICCD
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
110
click to vote
TSP
2010
14 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
HM
2007
Springer
15 years 3 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
ACMICEC
2007
ACM
15 years 1 months ago
2007
ACM
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...