2498 search results - page 66 / 500 » Data Structures with Unpredictable Timing |
KDD
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
In a typical realistic scenario, there exist some past data about the structure of the network which are analyzed with respect to some possibly future spreading process, such as b...
161
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
FM
2001
Springer
15 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...