4926 search results - page 95 / 986 » Two Graph Algorithms On an Associative Computing Model |
131
click to vote
ENDM
2010
15 years 2 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
136
click to vote
AAAI
2008
15 years 4 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
128
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
162
click to vote
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
105
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...