4542 search results - page 102 / 909 » Design patterns for data structures |
113
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
127
Voted
DKE
2006
15 years 2 months ago
2006
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
105
click to vote
ICMCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Presently, almost all of the watermarking algorithms resistant to geometric attacks are dependent on the synchronization. In this paper, a geometrically robust watermarking scheme...
114
Voted
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
119
click to vote
SPIRE
2009
Springer
15 years 9 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...