Results 1  10
of
282,153
Singularity Detection And Processing With Wavelets
 IEEE Transactions on Information Theory
, 1992
"... Most of a signal information is often found in irregular structures and transient phenomena. We review the mathematical characterization of singularities with Lipschitz exponents. The main theorems that estimate local Lipschitz exponents of functions, from the evolution across scales of their wavele ..."
Abstract

Cited by 590 (13 self)
 Add to MetaCart
Most of a signal information is often found in irregular structures and transient phenomena. We review the mathematical characterization of singularities with Lipschitz exponents. The main theorems that estimate local Lipschitz exponents of functions, from the evolution across scales
Existence of symmetric solutions for a fourthorder multipoint boundary value problem with a pLaplacian at resonance
 College of Science, Zhejiang University of Technology
"... Abstract. We consider the fourthorder differential equation with onedimensional pLaplacian (φp(x′′(t)))′ ′ = f(t, x(t), x′(t), x′′(t)) a.e. t ∈ [0, 1], subject to the boundary conditions x′′(0) = 0, (φp(x′′(t)))′t=0 = 0, x(0) = ∑n i=1 µix(ξi), x(t) = x(1 − t), t ∈ [0, 1], where φp(s) = sp− ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We consider the fourthorder differential equation with onedimensional pLaplacian (φp(x′′(t)))′ ′ = f(t, x(t), x′(t), x′′(t)) a.e. t ∈ [0, 1], subject to the boundary conditions x′′(0) = 0, (φp(x′′(t)))′t=0 = 0, x(0) = ∑n i=1 µix(ξi), x(t) = x(1 − t), t ∈ [0, 1], where φp(s) = sp
MULTIPLICITY OF SOLUTIONS FOR A CLASS OF RESONANT pLAPLACIAN DIRICHLET PROBLEMS
, 2009
"... We consider nonlinear Dirichlet problems driven by the pLaplacian, which are resonant at + ∞ with respect to the principal eigenvalue. Using a variational approach based on the critical point theory, we show that the problem has three nontrivial smooth solutions, two of which have constant sign (o ..."
Abstract
 Add to MetaCart
We consider nonlinear Dirichlet problems driven by the pLaplacian, which are resonant at + ∞ with respect to the principal eigenvalue. Using a variational approach based on the critical point theory, we show that the problem has three nontrivial smooth solutions, two of which have constant sign
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
pLaplacian problems with jumping nonlinearities
 J. Differential Equations
"... Abstract. We consider the pLaplacian boundary value problem −(φp(u ′ (x)) ′ = f(x, u(x), u ′ (x)), a.e. x ∈ (0, 1), (1) c00u(0) + c01u ′ (0) = 0, c10u(1) + c11u ′ (1) = 0, (2) where p> 1 is a fixed number, φp(s) = s  p−2 s, s ∈ R, and for each j = 0, 1, cj0  + cj1 > 0. The function ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. We consider the pLaplacian boundary value problem −(φp(u ′ (x)) ′ = f(x, u(x), u ′ (x)), a.e. x ∈ (0, 1), (1) c00u(0) + c01u ′ (0) = 0, c10u(1) + c11u ′ (1) = 0, (2) where p> 1 is a fixed number, φp(s) = s  p−2 s, s ∈ R, and for each j = 0, 1, cj0  + cj1 > 0
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of ...
Closedform solution of absolute orientation using unit quaternions
 J. Opt. Soc. Am. A
, 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the leastsquares pr ..."
Abstract

Cited by 973 (4 self)
 Add to MetaCart
squares problem for three or more points. Currently various empirical, graphical, and numerical iterative methods are in use. Derivation of the solution is simplified by use of unit quaternions to represent rotation. I emphasize a symmetry property that a solution to this problem ought to possess. The best
A multilinear singular value decomposition
 SIAM J. Matrix Anal. Appl
, 2000
"... Abstract. We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higherorder tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, firstorder perturbation effects, etc., are ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
Abstract. We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higherorder tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, firstorder perturbation effects, etc
Results 1  10
of
282,153