3663 search results - page 389 / 733 » Problems in the ontology of computer programs |
208
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
180
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
183
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
191
click to vote
TMC
2010
15 years 5 months ago
2010
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
232
Voted
JMLR
2012
13 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...