Sciweavers

1333 search results - page 123 / 267
» Not a Number of Floating Point Problems
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 1 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
132
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
ICPP
2006
IEEE
15 years 10 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
COMGEO
2006
ACM
15 years 3 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
TASE
2008
IEEE
15 years 3 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail