Results 1  10
of
1,073
Cycles and stability
 Journal of Combinatorial Theory, Ser. B
"... We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n be sufficiently large, 0 < β < 2 × 10 −7, and the edges of K ⌊(2−β)n ⌋ be 2colored so that no mononchromatic Cn exists. Then, for some q ∈ ((1 − β) n,n), we may drop a vertex v so ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n be sufficiently large, 0 < β < 2 × 10 −7, and the edges of K ⌊(2−β)n ⌋ be 2colored so that no mononchromatic Cn exists. Then, for some q ∈ ((1 − β) n,n), we may drop a vertex v so
Cycles and Stability (full version)
, 2006
"... We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n 4, 0 < 1=2 1=2n, and the edges of Kb(2 )nc be 2colored so that no mononchromatic Cn exists. Then, for some q 2 ((1 )n 1; n) ; we may drop a vertex v so that in Kb(2 )nc v one o ..."
Abstract
 Add to MetaCart
We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n 4, 0 < 1=2 1=2n, and the edges of Kb(2 )nc be 2colored so that no mononchromatic Cn exists. Then, for some q 2 ((1 )n 1; n) ; we may drop a vertex v so that in Kb(2 )nc v one
.cn
"... edu.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary, it use ..."
Abstract
 Add to MetaCart
edu.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary
.cn
"... u.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary, it uses ..."
Abstract
 Add to MetaCart
u.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary, it uses
.cn
"... u.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary, it uses ..."
Abstract
 Add to MetaCart
u.cn Rather than creating and storing thousands of paraphrase examples, paraphrase templates have strong representation capacity and can be used to generate many paraphrase examples. This paper describes a new template representation and generalization method. Combing a semantic dictionary, it uses
edu.cn
"... Nowadays, approximate string search and join, as essential operations in data integration and cleaning, has attracted significant attentions in academic. In this paper, we study string similarity search and join with edit distance constraints. Although multicore machines have become the mainstream c ..."
Abstract
 Add to MetaCart
computer architecture, most existing methods only work on a uniprocessor. To address this problem, we propose a novel parallel framework using BWT. We also devise efficient technique to utilize cache to further speed up the performance. Our method can solve similar search and join efficiently and generally
Unifying instance–based and rule–based induction
 Machine Learning 24
, 1996
"... Abstract. Several welldeveloped approaches to inductive learning now exist, but each has specific limitations that are hard to overcome. Multistrategy learning attempts to tackle this problem by combining multiple methods in one algorithm. This article describes a unification of two widelyused em ..."
Abstract

Cited by 101 (7 self)
 Add to MetaCart
Abstract. Several welldeveloped approaches to inductive learning now exist, but each has specific limitations that are hard to overcome. Multistrategy learning attempts to tackle this problem by combining multiple methods in one algorithm. This article describes a unification of two widely
Algebraicity of holomorphic mappings between real algebraic sets in Cn
, 1995
"... Let A ⊂ C N be an irreducible real algebraic set. Assume that there exists p0 ∈ A such that A is a minimal, generic, holomorphically nondegenerate submanifold at p0. We show here that if H is a germ at p1 ∈ A of a holomorphic mapping from C N into itself, with Jacobian H not identically 0, and H(A ..."
Abstract

Cited by 49 (13 self)
 Add to MetaCart
Let A ⊂ C N be an irreducible real algebraic set. Assume that there exists p0 ∈ A such that A is a minimal, generic, holomorphically nondegenerate submanifold at p0. We show here that if H is a germ at p1 ∈ A of a holomorphic mapping from C N into itself, with Jacobian H not identically 0, and H
The global existence and convergence of the Calabi flow on Cn/Zn + iZn
 J. Funct. Anal
"... ar ..."
Results 1  10
of
1,073