5606 search results - page 365 / 1122 » Randomization Techniques for Graphs. |
170
click to vote
INFOVIS
2005
IEEE
16 years 7 days ago
2005
IEEE
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
177
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
193
click to vote
CN
2008
15 years 6 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
307
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
148
click to vote
SIGPRO
2002
15 years 6 months ago
2002
In blind source separation (BSS), two di erent separation techniques are mainly used: minimal mutual information (MMI), where minimization of the mutual output information yields ...