Sciweavers

2983 search results - page 114 / 597
» The group marriage problem
Sort
View
IJITM
2010
93views more  IJITM 2010»
14 years 11 months ago
A group evidential reasoning approach for enterprise architecture framework selection
: Enterprise architecture (EA) frameworks are used to ensure interoperability of information systems and improve the effectiveness and efficiency of business organisations. Several...
Faramak Zandi, Madjid Tavana
187
Voted
COCO
2011
Springer
261views Algorithms» more  COCO 2011»
14 years 19 days ago
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
Ryan O'Donnell, Yi Wu, Yuan Zhou

Publication
101views
13 years 6 months ago
On the degree and half-degree principle for symmetric polynomials
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Cordian Riener
127
Voted
JMLR
2012
13 years 3 months ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...
155
Voted
TEC
2012
234views Formal Methods» more  TEC 2012»
13 years 3 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao