Sciweavers

970 search results - page 107 / 194
» On encodings of spanning trees
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 11 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
14 years 3 months ago
On the stability of distance-based formation control
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
Dimos V. Dimarogonas, Karl Henrik Johansson
AIIA
2005
Springer
13 years 11 months ago
Building a Wide Coverage Dynamic Grammar
Incremental processing is relevant for language modeling, speech recognition and language generation. In this paper we devise a dynamic version of Tree Adjoining Grammar (DVTAG) th...
Alessandro Mazzei, Vincenzo Lombardo
ACL
1990
13 years 10 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
13 years 9 months ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson