Sciweavers

2498 search results - page 6 / 500
» Data Structures with Unpredictable Timing
Sort
View
IJCAI
1989
14 years 10 months ago
Input Data Management in Real-Time AI Systems
A real-time AI system in the real world needs to monitor an immense volume of data. To do this, the system must filter out much of the incoming data. However, it must remain re­ ...
Richard Washington, Barbara Hayes-Roth
SC
2003
ACM
15 years 2 months ago
Traffic-based Load Balance for Scalable Network Emulation
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...
Xin Liu, Andrew A. Chien
ICICS
2007
Springer
15 years 1 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
POPL
2008
ACM
15 years 10 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
TCS
2002
14 years 9 months ago
Augmenting the discrete timed automaton with other data structures
We describe a general automata-theoretic approach for analyzing the veri
Oscar H. Ibarra, Jianwen Su