4850 search results - page 317 / 970 » Approximate Data Structures with Applications |
165
click to vote
TECS
2002
15 years 6 months ago
2002
les to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and s...
203
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
181
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
168
Voted
WWW
2008
ACM
16 years 7 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
174
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...