Sciweavers

1004 search results - page 42 / 201
» Product representations of polynomials
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
CAGD
2005
112views more  CAGD 2005»
13 years 8 months ago
Estimating differential quantities using polynomial fitting of osculating jets
This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is...
Frédéric Cazals, Marc Pouget
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 8 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
DAGSTUHL
2006
13 years 9 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
DLOG
2001
13 years 9 months ago
TBoxes do not Yield a Compact Representation of Least Common Subsumers
For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descripti...
Franz Baader, Anni-Yasmin Turhan