774 search results - page 47 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
DAGM
2008
Springer
13 years 12 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
ICCAD
2008
IEEE
14 years 7 months ago
2008
IEEE
— The emergence of multi-core and many-core processors has introduced new opportunities and challenges to EDA research and development. While the availability of increasing paral...
AAIM
2009
Springer
14 years 4 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
IEEEPACT
2002
IEEE
14 years 3 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
LCTRTS
2007
Springer
14 years 4 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...