Sciweavers

3894 search results - page 342 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
APIN
2010
151views more  APIN 2010»
15 years 6 months ago
Improved PLSOM algorithm
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
Erik Berglund
JSS
2010
104views more  JSS 2010»
15 years 28 days ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman
IPSN
2004
Springer
15 years 11 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 4 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
MASS
2010
159views Communications» more  MASS 2010»
15 years 28 days ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia