2498 search results - page 58 / 500 » Data Structures with Unpredictable Timing |
111
click to vote
SDM
2012
SIAM
13 years 5 days ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
ACSC
2002
IEEE
15 years 2 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
101
click to vote
SSDBM
2009
IEEE
15 years 4 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
ADC
2004
Springer
15 years 1 months ago
2004
Springer
Current collaborative work environments are characterized by dynamically changing organizational structures. Although there have been several efforts to refine work distribution, ...
110
click to vote
ESTIMEDIA
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...