3360 search results - page 105 / 672 » Opportunistic Data Structures with Applications |
125
Voted
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
132
click to vote
ESA
1998
Springer
15 years 7 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
124
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
109
Voted
DAGSTUHL
2008
15 years 5 months ago
2008
Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds...
273
Voted
PADL
2009
Springer
16 years 4 months ago
2009
Springer
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...