Sciweavers

814 search results - page 38 / 163
» Optimal pairings
Sort
View
INFOCOM
2003
IEEE
14 years 3 months ago
Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach
—Wireless communications using ad hoc networks are receiving an increasing interest. The most attractive feature of ad hoc networks is the flexibility. The network is set up by ...
Peter Värbrand, Di Yuan, Patrik Björklun...
TMI
2002
155views more  TMI 2002»
13 years 9 months ago
Active Shape Model Segmentation with Optimal Features
Abstract--An active shape model segmentation scheme is presented that is steered by optimal local features, contrary to normalized first order derivative profiles, as in the origin...
Bram van Ginneken, Alejandro F. Frangi, Joes Staal...
SAC
2011
ACM
13 years 21 days ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
ECCV
2008
Springer
14 years 11 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
EOR
2008
75views more  EOR 2008»
13 years 10 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist