Sciweavers

664 search results - page 8 / 133
» Some results for a class of generalized polynomials
Sort
View
ICML
1999
IEEE
14 years 8 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
ACS
2007
13 years 7 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
DAS
2008
Springer
13 years 9 months ago
New Oversampling Approaches Based on Polynomial Fitting for Imbalanced Data Sets
In classification tasks, class-modular strategy has been widely used. It has outperformed classical strategy for pattern classification task in many applications [1]. However, in ...
Sami Gazzah, Najoua Essoukri Ben Amara
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 8 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CONCUR
2006
Springer
13 years 11 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik