3068 search results - page 95 / 614 » Clustering with Multiple Graphs |
108
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
100
Voted
FUIN
2000
15 years 12 days ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
117
Voted
UAI
2004
15 years 2 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
101
click to vote
ISCAS
2002
IEEE
15 years 5 months ago
2002
IEEE
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
TVCG
2008
15 years 14 days ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...