Sciweavers

11328 search results - page 1927 / 2266
» Timed Branching Processes
Sort
View
TVLSI
1998
81views more  TVLSI 1998»
15 years 4 months ago
Maximum power estimation for CMOS circuits using deterministic and statistical approaches
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
Chuan-Yu Wang, Kaushik Roy
TCS
2002
15 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
140
Voted
TCS
2002
15 years 4 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon
155
Voted
TIT
2002
164views more  TIT 2002»
15 years 4 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
TOG
2002
154views more  TOG 2002»
15 years 4 months ago
Image based flow visualization
A new method for the visualization of two-dimensional fluid flow is presented. The method is based on the advection and decay of dye. These processes are simulated by defining eac...
Jarke J. van Wijk
« Prev « First page 1927 / 2266 Last » Next »