Sciweavers

1477 search results - page 79 / 296
» Random Convex Programs
Sort
View
MP
2011
12 years 11 months ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
AADA
2011
12 years 8 months ago
Sparse Template-Based variational Image Segmentation
We introduce a variational approach to image segmentation based on sparse coverings of image domains by shape templates. The objective function combines a data term that achieves ...
Dirk Breitenreicher, Jan Lellmann, Christoph Schn&...
ICALP
2009
Springer
14 years 3 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
ICALP
2007
Springer
14 years 2 months ago
On the Chromatic Number of Random Graphs
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
Amin Coja-Oghlan, Konstantinos Panagiotou, Angelik...
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 9 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt