Sciweavers

5331 search results - page 722 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
179
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
ACL
2003
15 years 8 months ago
Feedback Cleaning of Machine Translation Rules Using Automatic Evaluation
When rules of transfer-based machine translation (MT) are automatically acquired from bilingual corpora, incorrect/redundant rules are generated due to acquisition errors or trans...
Kenji Imamura, Eiichiro Sumita, Yuji Matsumoto
IJCAI
2001
15 years 8 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
IJCAI
2003
15 years 8 months ago
An Extension of the ICP Algorithm for Modeling Nonrigid Objects with Mobile Robots
The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Build...
Dirk Hähnel, Sebastian Thrun, Wolfram Burgard
WSCG
2004
142views more  WSCG 2004»
15 years 8 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...