Sciweavers

1857 search results - page 238 / 372
» Minimum Degree Orderings
Sort
View
ACSAC
1999
IEEE
15 years 10 months ago
Non-repudiation Evidence Generation for CORBA using XML
This paper focuses on the provision of a nonrepudiation service for CORBA. The current OMG specification of a CORBA non-repudiation service forces the programmer to augment the ap...
Michael Wichert, David B. Ingham, Steve J. Caughey
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 10 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
INFOCOM
1998
IEEE
15 years 10 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
15 years 10 months ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 10 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...