1101 search results - page 114 / 221 » An Algorithm for the Graph Crossing Number Problem |
162
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
192
click to vote
EDBT
2012
ACM
13 years 7 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
147
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
135
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
152
click to vote
DAC
2009
ACM
16 years 6 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...