Sciweavers

2304 search results - page 216 / 461
» On the Vulnerability of Large Graphs
Sort
View
TIP
2010
155views more  TIP 2010»
15 years 5 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
GD
2009
Springer
15 years 4 months ago
On Open Problems in Biological Network Visualization
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
ESORICS
2011
Springer
14 years 6 months ago
Automated Information Flow Analysis of Virtualized Infrastructures
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
Sören Bleikertz, Thomas Groß, Matthias ...
ISPASS
2009
IEEE
16 years 1 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
ICITA
2005
IEEE
16 years 6 days ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak