2512 search results - page 483 / 503 » Learning from Highly Structured Data by Decomposition |
DIALM
2004
ACM
15 years 3 months ago
2004
ACM
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
81
Voted
ICS
2004
Tsinghua U.
15 years 3 months ago
2004
Tsinghua U.
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
81
Voted
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
IJFCS
2008
14 years 9 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...