Sciweavers

5595 search results - page 711 / 1119
» Comparing Subsumption Optimizations
Sort
View
192
Voted
ACL
2009
15 years 5 months ago
Asynchronous Binarization for Synchronous Grammars
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
John DeNero, Adam Pauls, Dan Klein
GI
2009
Springer
15 years 5 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf
IGARSS
2009
15 years 5 months ago
A Novel STAP Algorithm using Sparse Recovery Technique
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
Ke Sun, Hao Zhang, Gang Li, Huadong Meng, Xiqin Wa...
AISS
2010
161views more  AISS 2010»
15 years 5 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
261
Voted
ICIP
2010
IEEE
16 years 2 months ago
Real-time content-aware image resizing using reduced linear model
In this paper is presented an effective and efficient method for content-aware image resizing. It is based on the solution of a linear system where each pixel displacement (compres...
Edoardo Ardizzone, Roberto Gallea, Roberto Pirrone