Results 1  10
of
230,711
On the Power of Equivalence Queries
, 1994
"... In 1990, Angluin showed that no class exhibiting a combinatorial property called "approximate fingerprints" can be identified exactly using polynomially many Equivalence queries (of polynomial size). Here we show that this is a necessary condition: every class without approximate fingerpri ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In 1990, Angluin showed that no class exhibiting a combinatorial property called "approximate fingerprints" can be identified exactly using polynomially many Equivalence queries (of polynomial size). Here we show that this is a necessary condition: every class without approximate
NonEquivalent Query Rewritings
 In International Database Conference, Hong Kong
, 1999
"... this paper, we apply this concept of nonequivalent query rewriting to the problem of maintaining view definitions (data warehouses), where it now allows us to handle a much larger class of changes of the underlying information sources, namely not only data but also schema changes. This relaxed quer ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
this paper, we apply this concept of nonequivalent query rewriting to the problem of maintaining view definitions (data warehouses), where it now allows us to handle a much larger class of changes of the underlying information sources, namely not only data but also schema changes. This relaxed
Learning Unions of Boxes with Membership and Equivalence Queries
 in Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory
, 1994
"... We present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axisparallel boxes in ddimensional discretized Euclidean space where each coordinate can have n discrete values. The first algorithm receives at most sd count ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axisparallel boxes in ddimensional discretized Euclidean space where each coordinate can have n discrete values. The first algorithm receives at most sd
Learning Multivariate Polynomials from Substitution and Equivalence Queries
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 1996
"... It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory. Membersh ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory
Using Fewer Examples to Simulate Equivalence Queries
, 1996
"... It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989) and ..."
Abstract
 Add to MetaCart
It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989
Querying objectoriented databases
 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1992
"... We present a novel language for querying objectoriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the firstorder formalization of objectoriented languages from [KW89, KLW90, KW92]. The language inco ..."
Abstract

Cited by 493 (6 self)
 Add to MetaCart
We present a novel language for querying objectoriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the firstorder formalization of objectoriented languages from [KW89, KLW90, KW92]. The language
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
 Information Processing Letters
, 1996
"... We present a 2 time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAClearnable in subexponential time under any distribution. This is the first subexponential time PAClearning algorithm for DNF under any distribution. ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
We present a 2 time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAClearnable in subexponential time under any distribution. This is the first subexponential time PAClearning algorithm for DNF under any distribution.
The Lorel Query Language for Semistructured Data
 International Journal on Digital Libraries
, 1997
"... We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inapprop ..."
Abstract

Cited by 734 (29 self)
 Add to MetaCart
We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages
Efficient and Effective Querying by Image Content
 Journal of Intelligent Information Systems
, 1994
"... In the QBIC (Query By Image Content) project we are studying methods to query large online image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include med ..."
Abstract

Cited by 500 (13 self)
 Add to MetaCart
In the QBIC (Query By Image Content) project we are studying methods to query large online image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include
Results 1  10
of
230,711