1356 search results - page 73 / 272 » Some New Results on Inverse Sorting Problems |
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we consider an X ray computed tomography (CT) image reconstruction problem using two different kinds of data: classical X-rays radiographic data and some geometrica...
JAVA
2000
Springer
14 years 24 days ago
2000
Springer
The file I/O classes present in Java have proven too inefficient to meet the demands of high-performance applications that perform large amounts of I/O. The inefficiencies stem pr...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
TCS
2008
13 years 9 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
MP
2002
13 years 8 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...