5606 search results - page 243 / 1122 » Randomization Techniques for Graphs. |
126
Voted
JCS
2006
15 years 1 months ago
2006
In recent years, the threats and damages caused by active worms have become more and more serious. In order to reduce the loss caused by fastspreading active worms, an effective de...
86
Voted
IJAIT
2002
15 years 27 days ago
2002
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
216
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
143
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
98
Voted
CCE
2006
15 years 1 months ago
2006
A randomized algorithm with stream splitting for design of heat exchanger networks is presented in this work. The algorithm has provisions for splitting any one of the process str...