Sciweavers

1628 search results - page 295 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
CIKM
2000
Springer
14 years 2 months ago
A Semi-Supervised Document Clustering Technique for Information Organization
This paper discusses a new type of semi-supervised document clustering that uses partial supervision to partition a large set of documents. Most clustering methods organizes docum...
Han-joon Kim, Sang-goo Lee
DAWAK
2000
Springer
14 years 2 months ago
Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...
Matteo Golfarelli, Dario Maio, Stefano Rizzi
EMMCVPR
1997
Springer
14 years 2 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ICS
2010
Tsinghua U.
14 years 1 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke