Sciweavers

17688 search results - page 202 / 3538
» Data Set Balancing
Sort
View
ICMCS
2006
IEEE
117views Multimedia» more  ICMCS 2006»
16 years 15 days ago
Data Hiding for Speech Bandwidth Extension and its Hardware Implementation
Most of the current speech transmission systems are only able to deliver speech signals in a narrow frequency band. This narrowband speech is characterized by a thin and muffled ...
Fan Wu, Siyue Chen, Henry Leung
AUSAI
2005
Springer
16 years 6 hour ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
Radim Belohlávek, Vilém Vychodil
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 10 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
DIS
2006
Springer
15 years 10 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
ACSC
2003
IEEE
15 years 10 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel