5350 search results - page 219 / 1070 » Space and time in eco-ontologies |
140
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
192
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
157
click to vote
AAAI
2007
15 years 9 months ago
2007
This paper deals with the monitoring and diagnosis of large discrete-event systems. The problem is to determine, online, all faults and states that explain the flow of observatio...
312
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
137
click to vote
PRL
2008
15 years 6 months ago
2008
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...