Sciweavers

8699 search results - page 1362 / 1740
» Elements of the Theory of Computation
Sort
View
TCS
2011
15 years 1 months ago
Optimizing n-variate (n+k)-nomials for small k
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
Philippe P. Pébay, J. Maurice Rojas, David ...
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
MIA
2010
104views more  MIA 2010»
15 years 1 months ago
Combining atlas based segmentation and intensity classification with nearest neighbor transform and accuracy weighted vote
In this paper, different methods to improve atlas based segmentation are presented. The first technique is a new mapping of the labels of an atlas consistent with a given intensit...
Michaël Sdika
TCIAIG
2010
15 years 1 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
TCSV
2010
15 years 1 months ago
Motion Refinement Based Progressive Side-Information Estimation for Wyner-Ziv Video Coding
During the past ten years, Wyner-Ziv video coding (WZVC) has gained a lot of research interests because of its unique characteristics of "simple encoding, complex decoding&quo...
Wei Liu, Lina Dong, Wenjun Zeng
« Prev « First page 1362 / 1740 Last » Next »