We announce a well-posedness result for the Laplace equation in weighted Sobolev spaces on polyhedral domains in R with Dirichlet boundary conditions. The weight is the distance to the set of singular boundary points. We give a detailed sketch of the proof in three dimensions.

In this paper we present a treatment for anaphoric pronouns and reflexives in a Type Logical Grammar. To this end, we introduce structural modalities into the left pronominal rule of the categorial calculus with limited contraction LLC [8]. Following a proposal due to Hepple [6], we also sketch an analysis for the long-distance anaphora seg from Icelandic.

A deformable shape model called Active Shape Structural Model (ASSM) is used within a biometric framework to define a biometric sketch recognition algorithm. Experimental results show that mainly structural relations rather than statistical features can be used to recognize sketches of different users with high accuracy.

Researchers have made significant strides in developing recognition techniques for surface sketches, with realized and potential applications to motivate extending these techniques towards analogous surfaceless sketches. Yet surface sketch recognition techniques remain largely untested in surfaceless environments and are still highly constrained for related surfaceless gesture recognition techn...

Constructing a distinctive and robust sketch descriptor is one of the most challenging problems in sketch based applications. In this paper, a new hand-drawn sketch descriptor is proposed. The proposed descriptor utilizes the statistic information of multiple features and bag-of-features representation to achieve translation and scale invariance and rotation robustness. The proposed descriptor ...

We give algorithms for the M-estimators minx ‖Ax− b‖G, where A ∈ Rn×d and b ∈ R, and ‖y‖G for y ∈ R n is specified by a cost function G : R 7→ R≥0, with ‖y‖G ≡ ∑ iG(yi). The M -estimators generalize `p regression, for which G(x) = |x|. We first show that the Huber measure can be computed up to relative error in O(nnz(A) logn + poly(d(log n)/ε)) time, where nnz(A) denotes the number of non-zero ...