Sciweavers

417 search results - page 34 / 84
» Convex Shape Decomposition
Sort
View
JPDC
2006
148views more  JPDC 2006»
13 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
IDEAL
2007
Springer
14 years 1 months ago
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, T...
ICASSP
2011
IEEE
12 years 11 months ago
Simultaneous SDR optimality via a joint matrix decomposition
Abstract—This work considers the joint source-channel problem of transmitting a Gaussian source over a two-user multipleinput multiple-output (MIMO) broadcast channel. We show th...
Yuval Kochman, Anatoly Khina, Uri Erez
CG
2002
Springer
13 years 7 months ago
Mesh parameterization with a virtual boundary
Parameterization of a 3D triangular mesh is a fundamental problem in various applications of meshes. The convex combination approach is widely used for parameterization because of...
Yunjin Lee, Hyoung Seok Kim, Seungyong Lee
TSP
2010
13 years 2 months ago
Improved dual decomposition based optimization for DSL dynamic spectrum management
Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The b...
Paschalis Tsiaflakis, Ion Necoara, Johan A. K. Suy...