Sciweavers

2656 search results - page 299 / 532
» Design and analysis of algorithms reconsidered
Sort
View
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
16 years 1 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 1 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
SEMWEB
2007
Springer
16 years 1 months ago
Evaluating the Semantic Web: A Task-Based Approach
The increased availability of online knowledge has led to the design of several algorithms that solve a variety of tasks by harvesting the Semantic Web, i.e., by dynamically select...
Marta Sabou, Jorge Gracia, Sofia Angeletou, Mathie...
DAC
2006
ACM
16 years 1 months ago
Buffer memory optimization for video codec application modeled in Simulink
Reduction of the on-chip memory size is a key issue in video codec system design. Because video codec applications involve complex algorithms that are both data-intensive and cont...
Sang-Il Han, Xavier Guerin, Soo-Ik Chae, Ahmed Ami...
ICIP
2005
IEEE
16 years 27 days ago
Bayesian blind source separation for brain imaging
This paper deals with the problem of blind source separation in fMRI data analysis. Our main contribution is to present a maximum likelihood based method to blindly separate the b...
Hicham Snoussi, Vince D. Calhoun