10608 search results - page 656 / 2122 » Complexity of O'Hara's Algorithm |
207
Voted
QSHINE
2005
IEEE
16 years 25 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
179
click to vote
APPROX
2005
Springer
16 years 24 days ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
196
click to vote
RT
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolut...
214
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
220
click to vote
CODES
2006
IEEE
15 years 9 months ago
2006
IEEE
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...