2254 search results - page 153 / 451 » Computing the minimal covering set |
151
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
A CORDIC based processor array which can be programmed by switch settings to compute the Discrete Hariley, Cosine or Sine lhnsforms or their inverses is described. Through a novel...
177
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
179
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a recording scheme, image formation model and reconstruction method that enables image-based modeling of flowing bodies of water from multi-video input data. The record...
163
click to vote
VLSID
2003
IEEE
16 years 7 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
157
click to vote
COR
2007
15 years 6 months ago
2007
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...