Sciweavers

99 search results - page 2 / 20
» Improved bounds and new techniques for Davenport-Schinzel se...
Sort
View
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
13 years 10 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 1 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
IWDW
2005
Springer
13 years 10 months ago
Performance Lower Bounds for Existing and New Uncoded Digital Watermarking Modulation Techniques
Abstract. Many coded digital watermarking systems development requires first the selection of a (uncoded) modulation technique to be part of a coded architecture. Therefore, perfo...
Marcos de Castro Pacitti, Weiler Alves Finamore
ECCV
2004
Springer
13 years 10 months ago
A New Robust Technique for Stabilizing Brightness Fluctuations in Image Sequences
Abstract. Temporal random variation of luminance in images can manifest in film and video due to a wide variety of sources. Typical in archived films, it also affects scenes rec...
François Pitié, Rozenn Dahyot, Franc...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 1 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat