Sciweavers

1538 search results - page 21 / 308
» Relative Randomness and Cardinality
Sort
View
TAMC
2009
Springer
14 years 4 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
EOR
2006
83views more  EOR 2006»
13 years 9 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
JSAT
2006
92views more  JSAT 2006»
13 years 9 months ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
12 years 2 days ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic