Sciweavers

28888 search results - page 15 / 5778
» Computability and complexity in analysis
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
EWCBR
2006
Springer
13 years 11 months ago
An Analysis on Transformational Analogy: General Framework and Complexity
In this paper we present TransUCP, a general framework for transformational analogy. Using our framework we demonstrate that transformational analogy does not meet a crucial condit...
Vithal Kuchibatla, Héctor Muñoz-Avil...
ICIP
2007
IEEE
14 years 9 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach
CVPR
2007
IEEE
14 years 9 months ago
Statistical Shape Analysis of Multi-Object Complexes
An important goal of statistical shape analysis is the discrimination between populations of objects, exploring group differences in morphology not explained by standard volumetri...
Kevin Gorczowski, Martin Styner, Ja-Yeon Jeong, J....
TON
2010
125views more  TON 2010»
13 years 2 months ago
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
Reuven Cohen, Liran Katzir