Results 1  10
of
2,447,165
Fixing numbers for matroids
, 2014
"... Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group). We prove the fixing numbers for the cycle matroid an ..."
Abstract
 Add to MetaCart
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group). We prove the fixing numbers for the cycle matroid
Fixing numbers of graphs and groups
, 2006
"... The fixing number of a graph G is the smallest cardinality of a set of vertices S such that only the trivial automorphism of G fixes every vertex in S. The fixing set of a group Γ is the set of all fixing numbers of finite graphs with automorphism group Γ. Several authors have studied the distinguis ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The fixing number of a graph G is the smallest cardinality of a set of vertices S such that only the trivial automorphism of G fixes every vertex in S. The fixing set of a group Γ is the set of all fixing numbers of finite graphs with automorphism group Γ. Several authors have studied
Tiling the Plane with a Fixed Number of
, 2008
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Improving generalization with active learning
 Machine Learning
, 1994
"... Abstract. Active learning differs from "learning from examples " in that the learning algorithm assumes at least some control over what part of the input domain it receives information about. In some situations, active learning is provably more powerful than learning from examples ..."
Abstract

Cited by 544 (1 self)
 Add to MetaCart
alone, giving better generalization for a fixed number of training examples. In this article, we consider the problem of learning a binary concept in the absence of noise. We describe a formalism for active concept learning called selective sampling and show how it may be approximately implemented by a
Computing With a Fixed Number of Pointers
 FSTTCS
, 2013
"... Consider the Pcomplete problem horn which asks whether a given set of Horn clauses is (un)satisfiable. To solve it one keeps a dynamic set of atoms that are forced to be true. Using the clauses one then adds atoms to this set until saturation is reached. It is easy to see that this dynamic set will ..."
Abstract
 Add to MetaCart
Consider the Pcomplete problem horn which asks whether a given set of Horn clauses is (un)satisfiable. To solve it one keeps a dynamic set of atoms that are forced to be true. Using the clauses one then adds atoms to this set until saturation is reached. It is easy to see that this dynamic set will in general more than constant size even if we allow to discard already proved atoms. Given that we need logarithmic space to store a single atom on a Turing machine tape this seems like a strong intuitive argument for the hypothesis that logarithmic space is different from polynomial time. We thus tried to find formal models of computation in which this intuitive argument can be made rigorous. Thus, we study computational models that can be simulated in logarithmic space and encompass logspace algorithms which manipulate a constant size of objects that require logarithmic space individually such as pointers or graph nodes. The hope is then to be able to show that such models are provably unable to solve Pcomplete problems. We report in this survey article on our partial results towards this goal as well as the stateoftheart in general.
Hamiltonian Alternating Cycles with Fixed Number of Color Appearances,
 Applied Mathematical Sciences,
, 2012
"... Abstract In this paper we consider an approach to solve the problem of existence of Hamiltonian alternating cycle with fixed number of color appearances. This approach is based on constructing logical models for the problem. ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
Abstract In this paper we consider an approach to solve the problem of existence of Hamiltonian alternating cycle with fixed number of color appearances. This approach is based on constructing logical models for the problem.
The Generative Lexicon
 Computational Linguistics
, 1991
"... this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central prob ..."
Abstract

Cited by 1340 (45 self)
 Add to MetaCart
of semantic description, where the semantic load is spread more evenly throughout the lexicon. I argue that lexical decomposition is possible if it is performed generatively. Rather than assuming a fixed set of primitives, I will assume a fixed number of generative devices that can be seen as constructing
Efficient belief propagation for early vision
 In CVPR
, 2004
"... Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph cuts and belief propagation yield accurate results, but despite recent advances are often still too slow for practical u ..."
Abstract

Cited by 517 (8 self)
 Add to MetaCart
is important for problems such as optical flow or image restoration that have a large label set. A second technique makes it possible to obtain good results with a small fixed number of message passing iterations, independent of the size of the input images. Taken together these techniques speed up
Results 1  10
of
2,447,165