Sciweavers

7930 search results - page 267 / 1586
» Greedy in Approximation Algorithms
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
Piecing Together the Segmentation Jigsaw using Context
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...
Xi Chen, Arpit Jain, Abhinav Gupta, Larry Davis
TON
2010
168views more  TON 2010»
15 years 1 months ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
Jun Luo, Catherine Rosenberg, André Girard
ESSMAC
2003
Springer
15 years 11 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
BIBE
2007
IEEE
138views Bioinformatics» more  BIBE 2007»
16 years 28 days ago
A Flexible Stem-Based Local Search Algorithm for Predicting RNA Secondary Structures Including Pseudoknots
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
Xiang Chen, Simin He, Dongbo Bu, Runsheng Chen, We...
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
16 years 22 days ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...