3146 search results - page 319 / 630 » Efficient Consequence Finding |
135
click to vote
SMI
1999
IEEE
15 years 9 months ago
1999
IEEE
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
123
click to vote
FPGA
1999
ACM
15 years 9 months ago
1999
ACM
One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. The configuration compression algorithm presented in our prev...
122
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
151
click to vote
QCQC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
135
Voted
CIAC
1997
Springer
15 years 8 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...