Results 231 to 240 of about 656,245 (262)

Almost optimal polyhedral separators

Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994
We animate two deterministic polynomial time methods for finding a separator for two nested convex polyhedra in 3d. While this problem is NP-complete, we show a reduction to set cover. We then animate the greedy method and the weighted method.
openaire   +1 more source

Almost optimal permutation routing on hypercubes

Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We introduce the first (on-line and off-line) algorithms routing any permutation on the d-dimensional hypercube in d+o(d) steps. The best previously known results were 2d+o(d) (oblivious on-line) and 2d-3 (off-line).
openaire   +2 more sources

Almost Optimal Dynamic 2–3 trees

Journal of Computer Science and Technology, 1986
This paper presents a principle to create almost optimal dynamical 2-3 trees based on the theory of \textit{R. Miller}, \textit{N. Pippenger}, \textit{A. Rosenberg}, and \textit{L. Snyder} [SIAM J. Comput. 8, 42-59 (1979; Zbl 0458.05026)], and gives a searching algorithm, an insertion algorithm and a deletion algorithm for these 2-3 trees. Experimental
openaire   +1 more source

Almost Optimal Adaptive LQ Control: SISO Case

Mathematics of Control, Signals, and Systems (MCSS), 2002
An indirect adaptive controller for an input/output dynamical system is proposed. The approach is based on the nominal input/state/output representation first proposed in [\textit{R. Gessing}, ``State space and internal models in discrete-time LQ regulator design'', Proceedings of the 7th Mediterranean Conference on Control and Automation (MED 99 ...
Daams, Jasper, Polderman, Jan Willem
openaire   +2 more sources

Almost Optimal Private Information Retrieval

2003
A private information retrieval (PIR) protocol allows a user to retrieve one of N records from a database while hiding the identity of the record from the database server. With the initially proposed PIR protocols to process a query, the server has to process the entire database, resulting in an unacceptable response time for large databases.
Dmitri Asonov, Johann-Christoph Freytag
openaire   +1 more source

Almost Optimal Solutions for Bin Coloring Problems

Journal of Combinatorial Optimization, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Mingen, Lin, Zhiyong, Xu, Jinhui
openaire   +2 more sources

Statistically optimal almost-invariant sets

Physica D: Nonlinear Phenomena, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Almost Optimal Hash Sequence Traversal

2003
We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log2n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [2],
Don Coppersmith, Markus Jakobsson
openaire   +1 more source

Some (almost) optimally extendable linear codes

Designs, Codes and Cryptography, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlet, Claude, Li, Chengju, Mesnager, Sihem   +2 more
openaire   +1 more source

Almost certain time-optimal positional control

IMA Journal of Mathematical Control and Information, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources