Sciweavers

3724 search results - page 236 / 745
» Timed regular expressions
Sort
View
ICML
2001
IEEE
16 years 6 months ago
Some Theoretical Aspects of Boosting in the Presence of Noisy Data
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
Wenxin Jiang
DAWAK
2007
Springer
15 years 9 months ago
A UML Profile for Representing Business Object States in a Data Warehouse
Data Warehouse (DWH) systems allow to analyze business objects relevant to an enterprise organization (e.g., orders or customers). Analysts are interested in the states of these bu...
Veronika Stefanov, Beate List
ANLP
2000
92views more  ANLP 2000»
15 years 7 months ago
Left-To-Right Parsing and Bilexical Context-Free Grammars
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
Mark-Jan Nederhof, Giorgio Satta
JGAA
2007
93views more  JGAA 2007»
15 years 5 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
FUIN
2002
60views more  FUIN 2002»
15 years 5 months ago
One-Visit Caterpillar Tree Automata
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki