3068 search results - page 250 / 614 » Clustering with Multiple Graphs |
142
click to vote
DAM
2008
15 years 5 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
174
click to vote
WABI
2009
Springer
16 years 4 days ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
156
click to vote
NAACL
2007
15 years 7 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
168
Voted
SIAMDM
2008
15 years 5 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
162
click to vote
MP
1998
15 years 5 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...