4926 search results - page 728 / 986 » Two Graph Algorithms On an Associative Computing Model |
172
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
191
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
187
click to vote
P2P
2005
IEEE
16 years 12 days ago
2005
IEEE
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
186
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
181
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...