Results 1  10
of
43,644
COUNTABLY COMPLEMENTABLE LINEAR ORDERINGS
, 2006
"... We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L does not embed into B if and only if B embeds into L. We characterize the linear orderings which are countably complementa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L does not embed into B if and only if B embeds into L. We characterize the linear orderings which are countably
Training Linear SVMs in Linear Time
, 2006
"... Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like text classification, wordsense disambiguation, and drug design. These applications involve a large number of examples n ..."
Abstract

Cited by 549 (6 self)
 Add to MetaCart
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like text classification, wordsense disambiguation, and drug design. These applications involve a large number of examples n
The complexity of datalog on linear orders
, 2009
"... We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIMEcomplete. While containment of the nonemptiness problem in EXPTIME is known for finite ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIMEcomplete. While containment of the nonemptiness problem in EXPTIME is known for finite
Is Linear Order Derived?
, 2011
"... The paper casts a critical eye on those dependency grammars (DGs) that view linear order as derived from hierarchical order. It argues that MTT is such a DG insofar as language synthesis begins with a semantic representation, progresses through syntactic representations that lack linear order, and t ..."
Abstract
 Add to MetaCart
The paper casts a critical eye on those dependency grammars (DGs) that view linear order as derived from hierarchical order. It argues that MTT is such a DG insofar as language synthesis begins with a semantic representation, progresses through syntactic representations that lack linear order
Cofinalities of Linear Orders
, 1999
"... We investigate whether the existence of long linear orders can be proved without the Axiom of Choice. This question has two different answers depending on its formalization. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate whether the existence of long linear orders can be proved without the Axiom of Choice. This question has two different answers depending on its formalization.
The Linear Ordering Problem (LOP)
"... ABSTRACT: In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is ..."
Abstract
 Add to MetaCart
ABSTRACT: In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible
ON LINEAR ORDERED CODES
, 2015
"... We consider linear codes in the metric space with the NiederreiterRosenbloomTsfasman (NRT) metric, calling them linear ordered codes. In the first part of the paper we examine a linearalgebraic perspective of linear ordered codes, focusing on the distribution of “shapes ” of codevectors. We def ..."
Abstract
 Add to MetaCart
We consider linear codes in the metric space with the NiederreiterRosenbloomTsfasman (NRT) metric, calling them linear ordered codes. In the first part of the paper we examine a linearalgebraic perspective of linear ordered codes, focusing on the distribution of “shapes ” of codevectors. We
CUTS OF LINEAR ORDERS
"... Abstract. We study the connection between the number of ascending and descending cuts of a linear order, its classical size, and its effective complexity (how much [how little] information can be encoded into it). 1. ..."
Abstract
 Add to MetaCart
Abstract. We study the connection between the number of ascending and descending cuts of a linear order, its classical size, and its effective complexity (how much [how little] information can be encoded into it). 1.
On Initial Segments of Computable Linear Orders
, 1997
"... We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to any computable linear order. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We show there is a computable linear order with a # 0 2 initial segment that is not isomorphic to any computable linear order.
ANTICHAINS IN PRODUCTS OF LINEAR ORDERS
"... Abstract. We show that: (1) For many regular cardinals λ (in particular, for all successors of singular strong limit cardinals, and for all successors of singular ωlimits), for all n ∈ {2, 3, 4,...}: There is a linear order L such that L n has no (incomparability)antichain of cardinality λ, while ..."
Abstract
 Add to MetaCart
Abstract. We show that: (1) For many regular cardinals λ (in particular, for all successors of singular strong limit cardinals, and for all successors of singular ωlimits), for all n ∈ {2, 3, 4,...}: There is a linear order L such that L n has no (incomparability)antichain of cardinality λ, while
Results 1  10
of
43,644