Sciweavers

1963 search results - page 240 / 393
» The Maximum Solution Problem on Graphs
Sort
View
97
Voted
ICIP
1998
IEEE
16 years 2 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
115
Voted
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 7 months ago
Joint Power and Channel Minimization in Topology Control: A Cognitive Network Approach
Abstract— Wireless topology control is the process of structuring the connectivity between network nodes to achieve some network-wide goal. This paper presents a cognitive networ...
Ryan W. Thomas, Ramakant S. Komali, Allen B. MacKe...
76
Voted
GECCO
2004
Springer
15 years 6 months ago
Virtual Ramping of Genetic Programming Populations
Abstract. Genetic Programming often uses excessive computational resources because the population size and the maximum number of generations per run are not optimized. We have deve...
Thomas Fernandez
177
Voted
ISTA
2007
15 years 2 months ago
Analytical data modeling of investment project financing process
: The present work is devoted to the research of investment projects’ financing issues. Within this paper a data analytical tool for an optimal financing schema computation on th...
Mikhail D. Godlevskiy, Valentina V. Moskalenko, Vl...
103
Voted
AUTOMATICA
2008
118views more  AUTOMATICA 2008»
15 years 26 days ago
Root-mean-square gains of switched linear systems: A variational approach
We consider the problem of computing the root-mean-square (RMS) gain of switched linear systems. We develop a new approach which is based on an attempt to characterize the "w...
Michael Margaliot, João Pedro Hespanha