127 search results - page 22 / 26 » Locally Thin Set Families |
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
ACL
1996
13 years 8 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
ADCM
2008
13 years 7 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
EOR
2008
13 years 7 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
IANDC
2010
13 years 4 months ago
2010
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...