Sciweavers

1933 search results - page 103 / 387
» Improved Algorithms for the Feedback Vertex Set 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...
142
Voted
ESWA
2010
105views more  ESWA 2010»
15 years 1 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
123
Voted
EVOW
2007
Springer
15 years 9 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
106
Voted
CIKM
2009
Springer
15 years 10 months ago
A query model based on normalized log-likelihood
Leveraging information from relevance assessments has been proposed as an effective means for improving retrieval. We introduce a novel language modeling method which uses inform...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
160
Voted
JCO
2007
149views more  JCO 2007»
15 years 3 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang