Sciweavers

1232 search results - page 89 / 247
» Digraphs: theory, algorithms and applications
Sort
View
ESANN
2000
15 years 7 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
184
Voted
JMLR
2002
138views more  JMLR 2002»
15 years 5 months ago
Text Chunking based on a Generalization of Winnow
This paper describes a text chunking system based on a generalization of the Winnow algorithm. We propose a general statistical model for text chunking which we then convert into ...
Tong Zhang, Fred Damerau, David Johnson
165
Voted
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 6 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
AIPS
2006
15 years 7 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan