Sciweavers

2542 search results - page 39 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
Efficient discrete fractional Hirschman optimal transform and its application
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
Wen-Liang Hsue, Soo-Chang Pei, Jian-Jiun Ding
VLDB
2002
ACM
126views Database» more  VLDB 2002»
14 years 11 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
CGF
2011
14 years 3 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
GLOBECOM
2010
IEEE
14 years 9 months ago
Maximization of Data Gathering in Clustered Wireless Sensor Networks
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
HPCC
2007
Springer
15 years 6 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...