11211 search results - page 1694 / 2243 » Rank-Sensitive Data Structures |
162
Voted
CIKM
2007
Springer
16 years 15 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
185
click to vote
KDD
2007
ACM
16 years 14 days ago
2007
ACM
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
152
click to vote
IEEEPACT
2006
IEEE
16 years 11 days ago
2006
IEEE
Modern out-of-order processors with non-blocking caches exploit Memory-Level Parallelism (MLP) by overlapping cache misses in a wide instruction window. The exploitation of MLP, h...
155
click to vote
SSDBM
2006
IEEE
16 years 10 days ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
171
click to vote
ICS
2005
Tsinghua U.
15 years 12 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...