3360 search results - page 269 / 672 » Opportunistic Data Structures with Applications |
174
click to vote
WEA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
142
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
164
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
139
click to vote
VISUALIZATION
2003
IEEE
15 years 10 months ago
2003
IEEE
Unstructured meshes are often used in simulations and imaging applications. They provide advanced flexibility in modeling abilities but are more difficult to manipulate and anal...
124
Voted
HASKELL
2005
ACM
15 years 10 months ago
2005
ACM
Haskell has proved itself to be a suitable implementation language for large software projects. Nevertheless, surprisingly few graphical end-user applications have been written in...