Sciweavers

5900 search results - page 125 / 1180
» Dependable Systems
Sort
View
ACL
2010
13 years 8 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
COORDINATION
2009
Springer
13 years 8 months ago
Automata for Context-Dependent Connectors
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
Marcello M. Bonsangue, Dave Clarke, Alexandra Silv...
ACL
2011
13 years 1 months ago
Joint Training of Dependency Parsing Filters through Latent Support Vector Machines
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
Colin Cherry, Shane Bergsma
ENTCS
2007
103views more  ENTCS 2007»
13 years 10 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
IJICT
2007
143views more  IJICT 2007»
13 years 10 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar