Sciweavers

1418 search results - page 43 / 284
» Schema polynomials and applications
Sort
View
ICNP
2000
IEEE
15 years 9 months ago
TCP-Probing: Towards an Error Control Schema with Energy and Throughput Performance Gains
Today’s universal communications increasingly involve mobile and battery-powered devices (e.g. hand-held, laptop) over wired and wireless networks. Energy efficiency, as well as...
Vassilios Tsaoussidis, Hussein G. Badr
PODS
2012
ACM
253views Database» more  PODS 2012»
13 years 7 months ago
Local transformations and conjunctive-query equivalence
Over the past several decades, the study of conjunctive queries has occupied a central place in the theory and practice of database systems. In recent years, conjunctive queries h...
Ronald Fagin, Phokion G. Kolaitis
COMBINATORICS
1999
91views more  COMBINATORICS 1999»
15 years 4 months ago
A Criterion for Unimodality
We show that if P(x) is a polynomial with nondecreasing, nonnegative coefficients, then the coefficient sequence of P(x + 1) is unimodal. Applications are given.
George Boros, Victor H. Moll
LATIN
2010
Springer
15 years 11 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
EDBT
2009
ACM
126views Database» more  EDBT 2009»
15 years 7 months ago
A tool for mapping discovery over revealing schemas
In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. da...
Verena Kantere, Dimos Bousounis, Timos K. Sellis