3466 search results - page 389 / 694 » Fast computation of special resultants |
191
click to vote
TLCA
1993
Springer
15 years 11 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
181
click to vote
DAC
1998
ACM
15 years 11 months ago
1998
ACM
Boolean division, and hence Boolean substitution, produces better result than algebraic division and substitution. However, due to the lack of an efficient Boolean division algorit...
209
click to vote
E2EMON
2006
IEEE
15 years 10 months ago
2006
IEEE
Analyzing Internet traffic at packet level involves generally large amounts of raw data, derived data, and results from various analysis tasks. In addition, the analysis often proc...
187
click to vote
ICS
2000
Tsinghua U.
15 years 10 months ago
2000
Tsinghua U.
The rapid advancements of networking technology have boosted potential bandwidth to the point that the cabling is no longer the bottleneck. Rather, the bottlenecks lie at the cros...
182
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...