2745 search results - page 432 / 549 » A fast algorithm for computing large Fibonacci numbers |
151
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
135
click to vote
COMCOM
2007
15 years 4 months ago
2007
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
155
click to vote
DAM
2000
15 years 4 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
152
click to vote
CORR
2012
Springer
14 years 11 days ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
128
click to vote
FPGA
2009
ACM
15 years 11 months ago
2009
ACM
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...