Sciweavers

358 search results - page 17 / 72
» GCD of Many Integers
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...
JSYML
2008
50views more  JSYML 2008»
13 years 7 months ago
Analytic and coanalytic families of almost disjoint functions
If F N N is an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable H N N, no member of which is cov...
Bart Kastermans, Juris Steprans, Yi Zhang 0008
APPML
2005
67views more  APPML 2005»
13 years 7 months ago
Semiharmonic bicyclic graphs
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
Stefan Grünewald, Dragan Stevanovic
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
CC
2004
Springer
115views System Software» more  CC 2004»
14 years 27 days ago
Periodic Polyhedra
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
Benoît Meister