Sciweavers

1458 search results - page 25 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
IRAL
2003
ACM
14 years 1 months ago
A practical text summarizer by paragraph extraction for Thai
In this paper, we propose a practical approach for extracting the most relevant paragraphs from the original document to form a summary for Thai text. The idea of our approach is ...
Chuleerat Jaruskulchai, Canasai Kruengkrai
TIT
2010
103views Education» more  TIT 2010»
13 years 3 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
14 years 1 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
KRDB
1994
78views Database» more  KRDB 1994»
13 years 9 months ago
The Problems of Data Modeling in Software Practice
This paper presents, fromthe author's perspective, the problems that occur in practice during data modelling. The author's experiences are a result of a considerable num...
Harald Huber
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
14 years 20 days ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri