Sciweavers

5055 search results - page 307 / 1011
» Relative Timing
Sort
View
FCT
2003
Springer
16 years 14 days ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
15 years 12 months ago
Output feedback strategies for systems with impulsive and fast controls
— This paper deals with output feedback impulse control under set-membership uncertainty where the control realization consists of a sequence of δ-impulses. It indicates solutio...
Alexander N. Daryin, Irina A. Digailova, Alexander...
KES
2009
Springer
15 years 12 months ago
Virtual Communities of Practice's Purpose Evolution Analysis Using a Concept-Based Mining Approach
Today, social networks systems have become more and more important. People have change their way to relate and communicate. Therefore, how to enhance contents and organization of a...
Sebastián A. Ríos, Felipe Aguilera, ...
DAWAK
2000
Springer
15 years 11 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
AGP
1997
IEEE
15 years 11 months ago
Sharing Revisited
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella