Sciweavers

304 search results - page 33 / 61
» Programmable memory blocks supporting content-addressable me...
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
CIKM
2006
Springer
13 years 11 months ago
Resource-aware kernel density estimators over streaming data
A fundamental building block of many data mining and analysis approaches is density estimation as it provides a comprehensive statistical model of a data distribution. For that re...
Christoph Heinz, Bernhard Seeger
ICS
2004
Tsinghua U.
14 years 28 days ago
Adaptive incremental checkpointing for massively parallel systems
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in the...
Saurabh Agarwal, Rahul Garg, Meeta Sharma Gupta, J...
CSMR
1999
IEEE
13 years 12 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
ICCS
2007
Springer
13 years 9 months ago
Hypermedia Discourse: Contesting Networks of Ideas and Arguments
This invited contribution motivates the Hypermedia Discourse research programme, investigating the reading, writing and contesting of ideas as hypermedia networks grounded in disco...
Simon Buckingham Shum