Sciweavers

520 search results - page 28 / 104
» Reductions Between Expansion Problems
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
TSMC
2010
13 years 3 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ECAI
2004
Springer
14 years 2 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
SIAMAM
2002
61views more  SIAMAM 2002»
13 years 8 months ago
Self-Similar Solutions for Weak Shock Reflection
Abstract. We present numerical solutions of a two-dimensional Riemann problem for the unsteady transonic small disturbance equations that provides an asymptotic description of the ...
Allen M. Tesdall, John K. Hunter
ENTCS
2008
102views more  ENTCS 2008»
13 years 8 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin