Sciweavers

1356 search results - page 7 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
ICIAR
2007
Springer
14 years 1 months ago
Solving the Inverse Problem of Image Zooming Using "Self-Examples"
Abstract. In this paper we present a novel single-frame image zooming technique based on so-called “self-examples”. Our method combines the ideas of fractal-based image zooming...
Mehran Ebrahimi, Edward R. Vrscay
FOCS
1998
IEEE
13 years 11 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
SIAMJO
2002
149views more  SIAMJO 2002»
13 years 7 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel
BILDMED
2008
100views Algorithms» more  BILDMED 2008»
13 years 9 months ago
Detection of Point Scatterers by Regularized Inversion of a Linear Ultrasound System Model
Abstract. Scatterer detection in medical ultrasound imaging can be formulated as an inverse problem concerning a linear system model based on point scatterers. The applicability of...
Tobias Gehrke, Heinrich M. Overhoff
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu