4926 search results - page 494 / 986 » Two Graph Algorithms On an Associative Computing Model |
352
Voted
ICA
2012
Springer
13 years 11 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
90
Voted
ICSE
2009
IEEE-ACM
16 years 4 months ago
2009
IEEE-ACM
Features express the variabilities and commonalities among programs in a software product line (SPL). A feature model defines the valid combinations of features, where each combin...
154
Voted
KES
1999
Springer
15 years 8 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
131
Voted
IWQOS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
124
click to vote
NIPS
2003
15 years 5 months ago
2003
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...