343 search results - page 61 / 69 » On Making Directed Graphs Transitive |
116
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
KDD
2009
ACM
16 years 6 days ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
189
click to vote
POPL
2003
ACM
15 years 12 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
128
click to vote
FPGA
2010
ACM
14 years 12 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...