Sciweavers

2553 search results - page 114 / 511
» Modeling Trees with Hypertextures
Sort
View
IJCNN
2000
IEEE
15 years 2 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
CORR
1998
Springer
113views Education» more  CORR 1998»
14 years 9 months ago
Letter to Sound Rules for Accented Lexicon Compression
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
V. Pagel, Kevin Lenzo, Alan W. Black
FOCS
2009
IEEE
14 years 7 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
JAIR
2011
187views more  JAIR 2011»
14 years 4 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
ICIP
2002
IEEE
15 years 11 months ago
Unsupervised image segmentation via Markov trees and complex wavelets
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
Cián W. Shaffrey, Ian Jermyn, Nick G. Kings...