2252 search results - page 268 / 451 » Lower Bounds for Dynamic Algorithms |
221
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...
108
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
108
click to vote
ICCD
2003
IEEE
16 years 16 days ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
141
Voted
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
126
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...