2294 search results - page 283 / 459 » From Path Graphs to Directed Path Graphs |
164
Voted
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
162
Voted
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
99
Voted
CAV
2010
Springer
15 years 6 months ago
2010
Springer
We present the algorithms used in MCVETO (Machine-Code VErification TOol), a tool to check whether a stripped machinecode program satisfies a safety property. The verification p...
143
Voted
WAIM
2004
Springer
15 years 8 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
131
click to vote
DAM
2010
15 years 2 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...