Sciweavers

6568 search results - page 271 / 1314
» Reducing the Complexity of Reductions
Sort
View
TAMC
2009
Springer
16 years 1 months ago
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
GBRPR
2003
Springer
15 years 12 months ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
15 years 11 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
LCPC
2005
Springer
16 years 7 days ago
Manipulating MAXLIVE for Spill-Free Register Allocation
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
Shashi Deepa Arcot, Henry G. Dietz, Sarojini Priya...
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Single-loop decoding for multiview video coding
Multiview video coding (MVC) is currently being standardized by the Joint Video Team as an extension of H264/AVC. When an MVC bitstream is decoded, some views (named target views)...
Ying Chen, Ye-Kui Wang, Miska M. Hannuksela, Monce...