Sciweavers

137 search results - page 2 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
14 years 9 days ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
JSA
2000
175views more  JSA 2000»
13 years 5 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
EMNLP
2011
12 years 5 months ago
Lateen EM: Unsupervised Training with Multiple Objectives, Applied to Dependency Grammar Induction
We present new training methods that aim to mitigate local optima and slow convergence in unsupervised training by using additional imperfect objectives. In its simplest form, lat...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...
ICIP
2006
IEEE
14 years 7 months ago
Dependency Channel Modeling for a LDPC-Based Wyner-Ziv Video Compression Scheme
Research in distributed video coding for low complexity encoding has shown that without knowledge of the correlation between source and side information (i.e. the behavior of the ...
Ronald P. Westerlaken, Stefan Borchert, Rene Klein...
CICLING
2011
Springer
12 years 9 months ago
Ranking Multilingual Documents Using Minimal Language Dependent Resources
This paper proposes an approach of extracting simple and effective features that enhances multilingual document ranking (MLDR). There is limited prior research on capturing the co...
G. S. K. Santosh, N. Kiran Kumar, Vasudeva Varma