1402 search results - page 168 / 281 » Searching Cycle-Disjoint Graphs |
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
IDEAL
2007
Springer
15 years 4 months ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
103
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
111
click to vote
KDD
2012
ACM
13 years 15 days ago
2012
ACM
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...