Sciweavers

4843 search results - page 242 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICCV
1999
IEEE
16 years 5 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ADHOC
2010
292views more  ADHOC 2010»
15 years 3 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
149
Voted
FSTTCS
1999
Springer
15 years 7 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy
ESANN
2006
15 years 5 months ago
Determination of the Mahalanobis matrix using nonparametric noise estimations
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
Amaury Lendasse, Francesco Corona, Jin Hao, Nima R...
117
Voted
ESANN
2003
15 years 5 months ago
Mixture of Experts and Local-Global Neural Networks
- In this paper we investigate mixture of experts problems in the context of Local-Global Neural Networks. This type of architecture was originaly conceived for functional approxim...
Mayte Suárez-Fariñas, Carlos Eduardo...