1101 search results - page 147 / 221 » An Algorithm for the Graph Crossing Number Problem |
101
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
123
Voted
MCU
2004
15 years 4 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
107
click to vote
PAKDD
2004
ACM
15 years 8 months ago
2004
ACM
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
110
Voted
ECCV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
139
Voted
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool ...