270 search results - page 25 / 54 » Partitioning into Sets of Bounded Cardinality |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
COMBINATORICS
2006
13 years 8 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
FUN
2007
Springer
14 years 20 days ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....