Sciweavers

1798 search results - page 121 / 360
» Generating presentation constraints from rhetorical structur...
Sort
View
COLING
1996
15 years 7 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
IJRR
2007
236views more  IJRR 2007»
15 years 6 months ago
Towards High-resolution Imaging from Underwater Vehicles
Large area mapping at high resolution underwater continues to be constrained by sensor-level environmental constraints and the mismatch between available navigation and sensor acc...
Hanumant Singh, Christopher N. Roman, Oscar Pizarr...
ACMSE
2005
ACM
15 years 8 months ago
Generative approaches for application tailoring of mobile devices
The popularity of mobile devices has propelled the development of many useful location-aware applications. However, the heterogeneity of mobile devices necessitates that the softw...
Victoria Davis, Jeff Gray, Joel Jones
SC
1995
ACM
15 years 10 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
CODES
2008
IEEE
15 years 8 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner