1554 search results - page 171 / 311 » Parameterized Complexity and Approximation Algorithms |
109
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
139
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
212
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
117
click to vote
FOCM
2008
15 years 3 months ago
2008
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
108
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...