Sciweavers

1028 search results - page 110 / 206
» Character sets of strings
Sort
View
DEDS
2006
101views more  DEDS 2006»
13 years 9 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 9 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
FUIN
2002
92views more  FUIN 2002»
13 years 8 months ago
Characterization Results for Time-Varying Codes
Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a pro...
Ferucio Laurentiu Tiplea, Erkki Mäkinen, Drag...
HCI
2011
13 years 15 days ago
Discovering Context: Classifying Tweets through a Semantic Transform Based on Wikipedia
By mapping messages into a large context, we can compute the distances between them, and then classify them. We test this conjecture on Twitter messages: Messages are mapped onto t...
Yegin Genc, Yasuaki Sakamoto, Jeffrey V. Nickerson