Sciweavers

170 search results - page 1 / 34
» Cross-Composition: A New Technique for Kernelization Lower B...
Sort
View
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 9 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
STACS
2007
Springer
13 years 10 months ago
A New Rank Technique for Formula Size Lower Bounds
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
Troy Lee
GLVLSI
2000
IEEE
104views VLSI» more  GLVLSI 2000»
13 years 8 months ago
A new technique for estimating lower bounds on latency for high level synthesis
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
Helvio P. Peixoto, Margarida F. Jacome
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 4 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang