In the ordinal matroid secretary problem (MSP), candidates do not reveal numerical weights, but decision maker can still discern if a candidate is better than another. An algorithm [Formula: see text] probability-competitive every element from optimum appears with probability in output. This measure stronger standard utility competitiveness. Our main result introduction of technique based on fo...

Recent work in machine learning for information extraction has focused on two distinct sub-problems: the conventional problem of filling template slots from natural language text, and the problem of wrapper induction, learning simple extraction procedures (“wrappers”) for highly structured text such as Web pages produced by CGI scripts. For suitably regular domains, existing wrapper induction a...

The uniform quantizers used in typical wavelet image compression algorithms can introduce perceptually disturbing artifacts by decreasing visual smoothness. In this paper, we use local Hölder regularity to quantify changes in visual smoothness and propose a modified quantization scheme which constrains local regularity decreases. The reconstructed images show a significant perceptual improvemen...

We study topological von Neumann regularity and principal von Neumann regularity of Banach algebras. Our main objective is comparing these two types of Banach algebras and some other known Banach algebras with one another. In particular, we show that the class of topologically von Neumann regular Banach algebras contains all $C^*$-algebras, group algebras of compact abelian groups and ...

We construct orthonormal bases of compactly supported wavelets, with arbitrarily high regularity. The order of regularity increases linearly with the support width. We start by reviewing the concept of multiresolution analysis as well as several algorithms in vision decomposition and reconstruction. The construction then follows from a synthesis of these different approaches.

An independent transversal (IT) in a graph with given vertex partition is an set consisting of one each class. Several sufficient conditions are known for the existence IT and partition, which have been used over years to solve many combinatorial problems. Some these theorems algorithmic proofs, but there remains gap between best existential bounds obtainable by efficient algorithms. Recently, ...

the main purpose in this paper, to express strong algorithmic optimization in their ability to detect expression target of sar that use in aircraft, plane and satellites to observe the target on the ground. for this purpose,the sar technology and its applications are introduced. previous algorithms used in this field with poor diagnosis and appropriate speed is low, like means and fuzzy and pso...

We discuss regularity issues for minimizers of three nonlinear elliptic problems. They concern minimal cones, minimizing harmonic maps into a hemisphere, and radial local minimizers of semilinear elliptic equations. We describe the strong analogies among the three regularity theories. They all use a method originated in a paper of J. Simons on the area minimizing properties of cones.

we study topological von neumann regularity and principal von neumann regularity of banach algebras. our main objective is comparing these two types of banach algebras and some other known banach algebras with one another. in particular, we show that the class of topologically von neumann regular banach algebras contains all $c^*$-algebras, group algebras of compact abelian groups and cer...