6740 search results - page 368 / 1348 » An s -Hamiltonian Line Graph Problem |
153
Voted
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
122
click to vote
IJCAI
1993
15 years 5 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
184
click to vote
CLA
2007
15 years 6 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
120
Voted
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
153
Voted
ACSAC
2008
IEEE
15 years 11 months ago
2008
IEEE
Role hierarchies are fundamental to the role based access control (RBAC) model. The notion of role hierarchy is a well understood concept that allows senior roles to inherit the p...