2498 search results - page 434 / 500 » Data Structures with Unpredictable Timing |
C3S2E
2009
ACM
15 years 1 months ago
2009
ACM
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
101
click to vote
EUROMICRO
2009
IEEE
15 years 1 months ago
2009
IEEE
Runtime quality of software, such as availability and throughput, depends on architectural factors and execution environment characteristics (e.g. CPU speed, network latency). Alth...
COMPSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
Critical industrial applications or fault tolerant applications need for operating systems (OS) which guarantee a correct and safe behaviour in spite of the appearance of errors. ...
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...