10608 search results - page 368 / 2122 » Complexity of O'Hara's Algorithm |
88
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
87
Voted
DSD
2010
IEEE
15 years 1 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
101
Voted
COR
2008
15 years 27 days ago
2008
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...
114
Voted
INFORMATICALT
2006
15 years 24 days ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
AI
2005
Springer
15 years 22 days ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...