Sciweavers

1187 search results - page 97 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
ESANN
2003
15 years 4 months ago
Locally Linear Embedding versus Isotop
Abstract. Recently, a new method intended to realize conformal mappings has been published. Called Locally Linear Embedding (LLE), this method can map high-dimensional data lying o...
John Aldo Lee, Cédric Archambeau, Michel Ve...
WINE
2007
Springer
171views Economy» more  WINE 2007»
15 years 9 months ago
Characterizing Truthful Market Design
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
Mira Gonen, Rica Gonen, Elan Pavlov
AMC
2007
125views more  AMC 2007»
15 years 3 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
119
Voted
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
16 years 3 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
EJC
2008
15 years 3 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias