Sciweavers

653 search results - page 39 / 131
» The size of minimum 3-trees
Sort
View
STACS
2007
Springer
15 years 6 months ago
A Cubic Kernel for Feedback Vertex Set
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Hans L. Bodlaender
DAC
2000
ACM
16 years 24 days ago
The role of custom design in ASIC Chips
Custom design, in which the designer controls the physical structure of the chip, can greatly improve the speed, power, and delay of an ASIC chip without affecting design time. Th...
William J. Dally, Andrew Chang
ICALP
2004
Springer
15 years 5 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
TVLSI
2002
144views more  TVLSI 2002»
14 years 11 months ago
On-chip inductance cons and pros
Abstract--This paper provides a high level survey of the increasing effects of on-chip inductance. These effects are classified into desirable and nondesirable effects. Among the u...
Yehea I. Ismail
ECCC
2010
80views more  ECCC 2010»
14 years 12 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson