1658 search results - page 321 / 332 » Implementing Bit-addressing with Specialization |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
DAGSTUHL
1997
13 years 11 months ago
1997
This paper describes and demonstrates the e ectiveness of several metrics for data level comparison of direct volume rendering (DVR) algorithms. The focus is not on speed ups from...
MVA
2000
13 years 11 months ago
2000
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
RBAC
2000
13 years 11 months ago
2000
: Enabling Technologies for Role Based Online Decision Engines Thomas Hildmann, Thomas Gebhardt 22-Feb-2000 The goal of our work at the Technical University of Berlin is to develop...
COLING
1996
13 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...