1806 search results - page 182 / 362 » Some Functions Computable with a Fused-Mac |
168
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
159
click to vote
ECAI
1990
Springer
15 years 10 months ago
1990
Springer
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
202
click to vote
ACCESSNETS
2009
Springer
15 years 10 months ago
2009
Springer
In EPONs, differentiated services enable higher quality of service (QoS) for some queues over others. However, owing to the coarse granularity of DiffServ, DiffServ in EPONs can ha...
183
click to vote
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
209
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...