5973 search results - page 815 / 1195 » Fundamental forms of information |
231
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
185
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
This paper considers DoS attacks on DNS wherein attackers flood the nameservers of a zone to disrupt resolution of resource records belonging to the zone and consequently, any of ...
202
click to vote
CANDC
2005
ACM
15 years 8 months ago
2005
ACM
The workshop will explore in depth the nature of freedom and constraint in the creative process in digital fine art from the perspective of embodied mind. The problem is crucial t...
215
click to vote
DICS
2006
15 years 8 months ago
2006
Achieving software reliability takes many complementary techniques, directed at the process or at the products. This survey summarizes some of the most fruitful ideas. 1 OVERVIEW ...
192
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...