Sciweavers

485 search results - page 71 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ATAL
2009
Springer
14 years 2 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
SIGGRAPH
1991
ACM
13 years 11 months ago
Design and simulation of opera lighting and projection effects
A major problem challenging opera designers is the inability to coordinate lighting, projection systems, and set designs in the preliminary planning phase. New computer graphics t...
Julie Dorsey, François X. Sillion, Donald P...
ICPR
2002
IEEE
14 years 8 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...

Publication
210views
14 years 2 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre