Sciweavers

1170 search results - page 52 / 234
» How Fast Is Too Fast
Sort
View
SCAM
2007
IEEE
15 years 9 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
102
Voted
VTC
2007
IEEE
110views Communications» more  VTC 2007»
15 years 9 months ago
Spatially Interpolated OFDM with Channel Estimation for Fast Fading Channels
— OFDM is well suited for data-transmission over frequency-selective channels. If the cyclic prefix is chosen sufficiently long, intersymbol interference is avoided. Thus, the ...
Peter Klenner, Karl-Dirk Kammeyer
86
Voted
EUROPAR
2007
Springer
15 years 8 months ago
Getting 10 Gb/s from Xen: Safe and Fast Device Access from Unprivileged Domains
The networking performance available to Virtual Machines (VMs) can be low due to the inefficiencies of transferring network packets between the host domain and guests. This can lim...
Kieran Mansley, Greg Law, David Riddoch, Guido Bar...
123
Voted
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
113
Voted
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
15 years 8 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha