3600 search results - page 87 / 720 » The settling-time reducibility ordering |
157
Voted
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
250
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
This paper proposes scene warping, a layer-based stereoscopic image resizing method using image warping. The proposed method decomposes the input stereoscopic image pair into laye...
168
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
147
Voted
DEXAW
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
168
click to vote
ISCAS
2006
IEEE
16 years 4 days ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...