4926 search results - page 299 / 986 » Two Graph Algorithms On an Associative Computing Model |
183
click to vote
NETWORKING
2000
15 years 6 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
160
Voted
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
176
click to vote
TIP
2010
15 years 3 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
159
click to vote
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
149
Voted
GD
2003
Springer
15 years 10 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...