Sciweavers

1403 search results - page 46 / 281
» Set cover algorithms for very large datasets
Sort
View
AI
2001
Springer
14 years 1 months ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
IWDW
2009
Springer
14 years 3 months ago
Estimating the Information Theoretic Optimal Stego Noise
We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multip...
Andrew D. Ker
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
14 years 10 months ago
Large-Scale Deduplication with Constraints Using Dedupalog
We present a declarative framework for collective deduplication of entity references in the presence of constraints. Constraints occur naturally in many data cleaning domains and c...
Arvind Arasu, Christopher Ré, Dan Suciu
KDD
2002
ACM
1075views Data Mining» more  KDD 2002»
14 years 9 months ago
CLOPE: a fast and effective clustering algorithm for transactional data
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
Yiling Yang, Xudong Guan, Jinyuan You
ICDIM
2008
IEEE
14 years 3 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu