1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2011★ 1 cited
Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm
Siavosh Benabbas, Hyun Chul Lee, Joel Oren +1
We introduce a new regression problem which we call the Sum-Based Hierarchical Smoothing problem. Given a directed acyclic graph and a non-negative value, called target value, for…
cs.FL2010
Syntactic Complexity of Ideal and Closed Languages
Janusz Brzozowski, Yuli Ye
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is…