1066 search results - page 114 / 214 » Computing Private Set Operations with Linear Complexities |
107
Voted
SC
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, a systematic study of the effects of complexity of prediction methodology on its accuracy for a set of real applications on a variety of HPC systems is performed. R...
122
Voted
GD
2003
Springer
15 years 8 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
132
Voted
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
129
Voted
EUROGRAPHICS
2010
Eurographics
15 years 3 months ago
2010
Eurographics
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
128
Voted
COLING
2010
14 years 9 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...