3360 search results - page 103 / 672 » Opportunistic Data Structures with Applications |
174
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
129
Voted
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Distributed local memories, or scratchpads, have been shown to effectively reduce cost and power consumption of application-specific accelerators while maintaining performance. Th...
195
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
145
Voted
TPDS
1998
15 years 3 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
121
click to vote
IMR
2004
Springer
15 years 8 months ago
2004
Springer
MSTK is a powerful framework for low-level creation and manipulation of unstructured meshes. MSTK is not a mesh generator but it can be used to develop advanced mesh generation so...