1421 search results - page 59 / 285 » Algorithms for subsequence combinatorics |
134
Voted
VISUALIZATION
2003
IEEE
15 years 8 months ago
2003
IEEE
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
112
click to vote
SODA
2010
ACM
16 years 9 days ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
122
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
106
Voted
CPM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
126
click to vote
KDD
2000
ACM
15 years 6 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...