Sciweavers

1172 search results - page 13 / 235
» Constructions of generalized Sidon sets
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 5 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
EUSFLAT
2009
186views Fuzzy Logic» more  EUSFLAT 2009»
14 years 9 months ago
Analysis of Similarity Measures for Atanassov's Intuitionistic Fuzzy Sets
We consider some existing similarity measures for Atanassov's intuitionistic fuzzy sets (A-IFSs, for short). We show that neither similarity measures treating an A-IF as a sim...
Eulalia Szmidt, Janusz Kacprzyk
DCC
2004
IEEE
15 years 11 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger
STACS
2010
Springer
15 years 6 months ago
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
Vikraman Arvind, Srikanth Srinivasan
STACS
2007
Springer
15 years 5 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg