4850 search results - page 116 / 970 » Approximate Data Structures with Applications |
SIAMJO
2011
14 years 4 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
139
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
HPCA
2000
IEEE
15 years 2 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
106
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
145
click to vote
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...