Results 1  10
of
3,395
The solutions of two starheight problems for regular trees, Theoret
 Comput. Sci
, 1984
"... Revised Augu*<t i 983 Abstract. Regular trees can he detined by two types of rational exprwions. For these two types w;i solve the starheight problem, i.e., we show how to construct a rational expression of minimal starheight from the minimal graph of the given tree (i.e., the analogue of the ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Revised Augu*<t i 983 Abstract. Regular trees can he detined by two types of rational exprwions. For these two types w;i solve the starheight problem, i.e., we show how to construct a rational expression of minimal starheight from the minimal graph of the given tree (i.e., the analogue
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
Limited Discrepancy Search
 In Proceedings IJCAI’95
, 1995
"... Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution— but not always. Li ..."
Abstract

Cited by 304 (5 self)
 Add to MetaCart
Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution— but not always
Regular expression types for XML
"... We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations such as repetition (*), alternation (), etc., to describe XML documents. The novelty of our type sy ..."
Abstract

Cited by 204 (21 self)
 Add to MetaCart
system is a semantic presentation of subtyping, as inclusion between the sets of documents denoted by two types. We give several examples illustrating the usefulness of this form of subtyping in XML processing. The decision problem for the subtype relation reduces to the inclusion problem between tree
Illposed problems in early vision
 Proceedings of the IEEE
, 1988
"... The first processing stage in computational vision, also called early vision, consists of decoding twodimensional images in terms of properties of 30 surfaces. Early vision includes problems such as the recovery of motion and optical flow, shape from shading, surface interpolation, and edge detect ..."
Abstract

Cited by 227 (14 self)
 Add to MetaCart
The first processing stage in computational vision, also called early vision, consists of decoding twodimensional images in terms of properties of 30 surfaces. Early vision includes problems such as the recovery of motion and optical flow, shape from shading, surface interpolation, and edge
The partigame algorithm for variable resolution reinforcement learning in multidimensional statespaces
 MACHINE LEARNING
, 1995
"... Partigame is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous statespaces. In high dimensions it is essential that learning does not plan uniformly over a statespace. Partigame maintains a decisiontree partitioning of statespace and applies tec ..."
Abstract

Cited by 255 (9 self)
 Add to MetaCart
a solution that optimizes a realvalued criterion. Many simulated problems have been tested, ranging from twodimensional to ninedimensional statespaces, including mazes, path planning, nonlinear dynamics, and planar snake robots in restricted spaces. In all cases, a good solution is found
An equivalence between sparse approximation and Support Vector Machines
 A.I. Memo 1606, MIT Arti cial Intelligence Laboratory
, 1997
"... This publication can be retrieved by anonymous ftp to publications.ai.mit.edu. The pathname for this publication is: aipublications/15001999/AIM1606.ps.Z This paper shows a relationship between two di erent approximation techniques: the Support Vector Machines (SVM), proposed by V.Vapnik (1995), ..."
Abstract

Cited by 243 (7 self)
 Add to MetaCart
(the dictionary). We show that, if the data are noiseless, the modi ed version of Basis Pursuit DeNoising proposed in this paper is equivalent to SVM in the following sense: if applied to the same data set the two techniques give the same solution, which is obtained by solving the same quadratic
A.: Learning syntactic patterns for automatic hypernym discovery.
 Advances in Neural Information Processing Systems
, 2004
"... Abstract Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by the problem of automatically constructing and extending such taxonomies, in this paper we present a new algori ..."
Abstract

Cited by 223 (6 self)
 Add to MetaCart
algorithm for automatically learning hypernym (isa) relations from text. Our method generalizes earlier work that had relied on using small numbers of handcrafted regular expression patterns to identify hypernym pairs. Using "dependency path" features extracted from parse trees, we introduce a
Linear Objects: logical processes with builtin inheritance
, 1990
"... We present a new framework for amalgamating two successful programming paradigms: logic programming and objectoriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their ..."
Abstract

Cited by 206 (6 self)
 Add to MetaCart
the expressive power of Linear Objects compared to Prolog by several examples from the objectoriented domain, but we also show that it can be used to provide elegant solutions for problems arising in the standard style of logic programming.
Graph Indexing: A Frequent Structurebased Approach
, 2004
"... Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graphbased indices. In this paper, we investigate the is ..."
Abstract

Cited by 201 (25 self)
 Add to MetaCart
310 times better performance in comparison with a typical pathbased method, GraphGrep. The gIndex approach not only provides an elegant solution to the graph indexing problem, but also demonstrates how database indexing and query processing can benefit from data mining, especially frequent pattern
Results 1  10
of
3,395