Sciweavers

3894 search results - page 466 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
PERCOM
2010
ACM
15 years 2 months ago
Gateway designation for timely communications in instant mesh networks
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
Bo Xing, Mayur Deshpande, Sharad Mehrotra, Nalini ...
137
Voted
PVLDB
2010
97views more  PVLDB 2010»
15 years 2 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
ICIP
2010
IEEE
15 years 2 months ago
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
Yingsong Zhang, Nick G. Kingsbury
145
Voted
AUSAI
2010
Springer
15 years 2 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
TEC
2010
77views more  TEC 2010»
14 years 11 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader