Sciweavers

8499 search results - page 38 / 1700
» cans 2009
Sort
View
ECSQARU
2009
Springer
14 years 5 months ago
Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data
Abstract. We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structur...
Ofer Arieli, Anna Zamansky
IMA
2009
Springer
145views Cryptology» more  IMA 2009»
14 years 5 months ago
On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
Let f : F n 2 → F n 2 be an almost perfect nonlinear function (APN). The set Df := {(a, b) : f(x + a) − f(x) = b has two solutions} can be used to distinguish APN functions up ...
Yves Edel, Alexander Pott
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
ISAAC
2009
Springer
108views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...
Li Chen, Bin Fu
IWPEC
2009
Springer
14 years 5 months ago
Partitioning into Sets of Bounded Cardinality
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
Mikko Koivisto