Sciweavers

135 search results - page 26 / 27
» String Noninclusion Optimization Problems
Sort
View
PDCN
2004
13 years 10 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
DEBS
2007
ACM
14 years 14 days ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
JACM
2007
132views more  JACM 2007»
13 years 8 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 1 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
ICML
2008
IEEE
14 years 9 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...