Sciweavers

516 search results - page 50 / 104
» Sets of k-Independent Strings
Sort
View
ACL
1990
13 years 10 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
13 years 8 months ago
Multi-modal control using adaptive motion description languages
In this paper, we address the problem of adaptively enriching motion description languages for multi-modal control by systematically enlarging the set of available modes. This pro...
Tejas R. Mehta, Magnus Egerstedt
DEDS
2006
101views more  DEDS 2006»
13 years 8 months ago
Near-Optimal Online Control of Dynamic Discrete-Event Systems
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...
Lenko Grigorov, Karen Rudie
JPDC
2006
106views more  JPDC 2006»
13 years 8 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
PR
2000
103views more  PR 2000»
13 years 8 months ago
Genetic algorithm-based clustering technique
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...
Ujjwal Maulik, Sanghamitra Bandyopadhyay