2294 search results - page 182 / 459 » From Path Graphs to Directed Path Graphs |
95
Voted
WEBI
2005
Springer
15 years 3 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
CGO
2003
IEEE
15 years 1 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
100
Voted
TACAS
2010
Springer
14 years 8 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...