2304 search results - page 118 / 461 » On the Vulnerability of Large Graphs |
168
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
168
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
247
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
169
Voted
RP
2010
Springer
15 years 4 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
181
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...