Sciweavers

3894 search results - page 591 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
132
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
145
Voted
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 9 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
111
Voted
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
15 years 9 months ago
Identifying flat and tubular regions of a shape by unstable manifolds
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj
124
Voted
MOBIQUITOUS
2005
IEEE
15 years 9 months ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
142
Voted
MFCS
2005
Springer
15 years 9 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher