5592 search results - page 64 / 1119 » On Random Betweenness Constraints |
WIRN
2005
Springer
14 years 3 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
PRICAI
1998
Springer
14 years 2 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
JUCS
2007
13 years 9 months ago
2007
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
SSWMC
2004
13 years 11 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...