1538 search results - page 144 / 308 » Spectral Techniques in Graph Algorithms |
143
Voted
SIGSOFT
2003
ACM
16 years 4 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
157
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...
123
click to vote
ICCAD
2002
IEEE
16 years 22 days ago
2002
IEEE
Multiport memories are extensively used in modern system designs because of the performance advantages they offer. The increased memory access throughput could lead to significan...
158
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
126
click to vote
JEC
2006
15 years 3 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...