Sciweavers

Share
16 search results - page 2 / 4
» The descent set polynomial revisited
Sort
View
CAI
2007
Springer
9 years 10 days ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
8 years 6 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
NETWORKS
2006
8 years 6 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
EJC
2016
3 years 2 months ago
On permutations with bounded drop size
The maximum drop size of a permutation π of [n] = {1, 2, . . . , n} is defined to be the maximum value of i − π(i). Chung, Claesson, Dukes and Graham found polynomials Pk(x) ...
Joanna N. Chen, William Y. C. Chen
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
9 years 21 days ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
books