4843 search results - page 237 / 969 » The Shortcut Problem - Complexity and Approximation |
118
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
147
Voted
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
185
Voted
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
249
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
120
Voted
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...