Sciweavers

2907 search results - page 253 / 582
» Presentations of Structures in Admissible Sets
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
IJCNN
2007
IEEE
16 years 29 days ago
Image Classification Using Wavelet Coefficients in Low-pass Bands
— In this paper, a method based on wavelet coefficients in low-pass bands is proposed for the image classification with adaptive processing of data structures to organize a large...
Weibao Zou, Yan Li
CEC
2005
IEEE
16 years 8 days ago
Coevolution of neural Go players in a cultural environment
Abstract- We present experiments (co)evolving Go players based on artificial neural networks (ANNs) for a 5x5 board. ANN structure and weights are encoded in multi–chromosomal g...
Helmut A. Mayer, Peter Maier
ECML
2003
Springer
15 years 12 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
PLDI
1999
ACM
15 years 11 months ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard