Sciweavers

3823 search results - page 494 / 765
» Experiments with Random Projection
Sort
View
ASPLOS
2004
ACM
16 years 3 days ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
16 years 1 days ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
COMPGEOM
2003
ACM
15 years 12 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
206
Voted
MOBICOM
2003
ACM
15 years 12 months ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu
179
Voted
CCS
2001
ACM
15 years 11 months ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song