Sciweavers

2766 search results - page 377 / 554
» Algorithms for trigonometric polynomials
Sort
View
ECCC
2000
93views more  ECCC 2000»
15 years 4 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
PC
2000
93views Management» more  PC 2000»
15 years 4 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
MP
1998
105views more  MP 1998»
15 years 4 months ago
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
Gert A. Tijssen, Gerard Sierksma
MP
2007
95views more  MP 2007»
15 years 4 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
DLOG
2010
15 years 2 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...