4112 search results - page 481 / 823 » Efficient Algorithms for the Spoonerism Problem |
218
click to vote
JMLR
2008
15 years 7 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
195
click to vote
MP
2008
15 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
202
click to vote
CAD
2000
Springer
15 years 7 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
228
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
We simultaneously approach two tasks of nonlinear discriminant analysis and kernel selection problem by proposing a unified criterion, Fisher+Kernel Criterion. In addition, an eff...
195
Voted
IPPS
2002
IEEE
16 years 15 days ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....