Sciweavers

8825 search results - page 107 / 1765
» All for one or one for all
Sort
View
ATAL
2010
Springer
15 years 2 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
ANOR
2008
116views more  ANOR 2008»
15 years 1 months ago
Coordination mechanisms for inventory control in three-echelon serial and distribution systems
Abstract This paper is concerned with the coordination of inventory control in threeechelon serial and distribution systems under decentralized control. All installations in these ...
Henk Zijm, Judith Timmer
ALMOB
2006
97views more  ALMOB 2006»
15 years 1 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
CG
2006
Springer
15 years 1 months ago
Shape reasoning and understanding
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...
Bianca Falcidieno, Remco C. Veltkamp
TIT
2008
130views more  TIT 2008»
15 years 1 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager