3946 search results - page 384 / 790 » The computational complexity of choice sets |
233
Voted
SAC
2006
ACM
16 years 1 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
203
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
245
click to vote
ICCV
1999
IEEE
16 years 9 months ago
1999
IEEE
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
180
Voted
MFCS
2010
Springer
15 years 6 months ago
2010
Springer
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
193
click to vote
DAM
2011
15 years 2 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...