Sciweavers

313 search results - page 5 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
CLUSTER
2001
IEEE
13 years 11 months ago
A Distributed Object Model for Solving Irregularly Structured Problems on Cluster
This paper presents a distributed object model MOIDE for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is a...
Yudong Sun, Cho-Li Wang
PKC
2010
Springer
138views Cryptology» more  PKC 2010»
13 years 11 months ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
Mathias Herrmann, Alexander May
STACS
2009
Springer
14 years 2 months ago
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
Daniel Kirsten, Sylvain Lombardy
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 9 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus