Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Lower Bounds on Correction Networks
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
Grzegorz Stachowiak
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
11 years 6 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
11 years 6 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
ISAAC
2003
Springer
95views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Finding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
ISAAC
2003
Springer
93views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Range Mode and Range Median Queries on Lists and Trees
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
Danny Krizanc, Pat Morin, Michiel H. M. Smid
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
11 years 6 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
books