1002 search results - page 181 / 201 » Towards Graph Programs for Graph Algorithms |
123
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
137
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
122
click to vote
JSAC
2007
15 years 1 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
98
Voted
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
140
click to vote
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...