12519 search results - page 411 / 2504 » Approximation Problems Categories |
183
click to vote
PAMI
2011
15 years 1 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
149
click to vote
SBRN
2008
IEEE
16 years 1 months ago
2008
IEEE
The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the...
197
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
185
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
196
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...