Sciweavers

5230 search results - page 362 / 1046
» Dynamic Optimality -- Almost
Sort
View
ACL
2011
14 years 10 months ago
Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation
We describe an exact decoding algorithm for syntax-based statistical translation. The approach uses Lagrangian relaxation to decompose the decoding problem into tractable subprobl...
Alexander M. Rush, Michael Collins
ICMCS
2005
IEEE
114views Multimedia» more  ICMCS 2005»
16 years 14 days ago
Self Configurable Queries for Digital Image Libraries
Since multimedia information is characterized by motley types of media with different properties, multimedia content retrieval in digital libraries requires dynamic reconfigurable...
Panagiotis Karagiannis, Nikolaos D. Doulamis, Geor...
ISCAS
2003
IEEE
150views Hardware» more  ISCAS 2003»
16 years 4 days ago
Accurate rise time and overshoots estimation in RLC interconnects
A closed form expression for the rise time of a gate driving a distributed RLC line is introduced that is within 8% of dynamic circuit simulations for a wide range of RLC loads. I...
Noha H. Mahmoud, Yehea I. Ismail
GECCO
2003
Springer
16 years 2 days ago
Coarse-Graining in Genetic Algorithms: Some Issues and Examples
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
Andrés Aguilar Contreras, Jonathan E. Rowe,...
NIPS
2001
15 years 8 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo