Sciweavers

3406 search results - page 128 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs
In this paper, we introduce a higher-order MRF optimization framework. On the one hand, it is very general; we thus use it to derive a generic optimizer that can be applied to a...
Nikos Komodakis (University of Crete), Nikos Parag...
ISLPED
2004
ACM
123views Hardware» more  ISLPED 2004»
15 years 11 months ago
An efficient voltage scaling algorithm for complex SoCs with few number of voltage modes
Increasing demand for larger high-performance applications requires developing more complex systems with hundreds of processing cores on a single chip. To allow dynamic voltage sc...
Bita Gorjiara, Nader Bagherzadeh, Pai H. Chou
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 10 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 6 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
ICML
2003
IEEE
16 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich