Sciweavers

10901 search results - page 2011 / 2181
» Approximations in Distributed Optimization
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 3 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
IJDAR
2000
121views more  IJDAR 2000»
15 years 3 months ago
A method for restoration of low-resolution document images
Image restoration using resolution expansion is important in many areas of image processing. This paper introduces a restoration method for low-resolution text images which produce...
Paul D. Thouin, Chein-I Chang
EOR
2002
74views more  EOR 2002»
15 years 3 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
AC
1999
Springer
15 years 3 months ago
Architectures and patterns for developing high performance real-time ORB endsystems
Many types of applications can benefit from flexible and open middleware. CORBA is an emerging middleware standard for Object Request Brokers (ORBs) that simplifies the developmen...
Douglas C. Schmidt, David L. Levine, Chris Clevela...
CGF
1999
126views more  CGF 1999»
15 years 3 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
« Prev « First page 2011 / 2181 Last » Next »