Sciweavers

1977 search results - page 176 / 396
» The satisfactory partition problem
Sort
View
TIT
2010
112views Education» more  TIT 2010»
15 years 1 months ago
Twice-universal simulation of Markov sources and individual sequences
Abstract-- The problem of universal simulation given a training sequence is studied both in a stochastic setting and for individual sequences. In the stochastic setting, the traini...
Alvaro Martín, Neri Merhav, Gadiel Seroussi...
CSDA
2007
264views more  CSDA 2007»
15 years 6 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
SYNTHESE
2010
70views more  SYNTHESE 2010»
15 years 5 months ago
What ought probably means, and why you can't detach it
: Some intuitive normative principles raise vexing „detaching problems‟ by their failure to license modus ponens. I examine three such principles (a self-reliance principle and...
Stephen Finlay
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 7 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
GD
2008
Springer
15 years 7 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...