Sciweavers

1169 search results - page 114 / 234
» Comparing performance of algorithms for generating concept l...
Sort
View
IRI
2005
IEEE
14 years 2 months ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
ICIAP
1999
ACM
14 years 1 months ago
Texture Segmentation by Frequency-Sensitive Elliptical Competitive Learning
In this paper a new learning algorithm is proposed with the purpose of texture segmentation. The algorithm is a competitive clustering scheme with two specific features: elliptic...
Steve De Backer, Paul Scheunders
ICCAD
2003
IEEE
152views Hardware» more  ICCAD 2003»
14 years 6 months ago
Binding, Allocation and Floorplanning in Low Power High-Level Synthesis
This work is a contribution to high level synthesis for low power systems. While device feature size decreases, interconnect power becomes a dominating factor. Thus it is importan...
Ansgar Stammermann, Domenik Helms, Milan Schulte, ...
FORMATS
2006
Springer
14 years 22 days ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
CDES
2006
106views Hardware» more  CDES 2006»
13 years 10 months ago
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
Sirzat Kahramanli, Suleyman Tosun