549 search results - page 87 / 110 » On the Complexity of Restricted k-anonymity Problem |
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— Although there has been an increasing interest in dynamic bipedal locomotion for significant improvement of energy efficiency and dexterity of mobile robots in the real world...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
RWEB
2009
Springer
15 years 4 months ago
2009
Springer
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...