Sciweavers

9787 search results - page 367 / 1958
» A Utile Function Optimizer
Sort
View
EOR
2008
69views more  EOR 2008»
15 years 6 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
ICCV
2011
IEEE
14 years 6 months ago
Superpixels via Pseudo-Boolean Optimization
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
Yuhang Zhang, Richard Hartley, John Mashford, Stew...
JCM
2010
126views more  JCM 2010»
15 years 5 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
JSAC
2011
215views more  JSAC 2011»
15 years 1 months ago
Opportunistic Spectrum Sharing Schemes for CDMA-Based Uplink MAC in Cognitive Radio Networks
—We consider a wireless cognitive radio network in which a set of secondary users (SUs) opportunistically utilize the wireless spectrum licensed to the primary users (PUs) to tra...
Xi Zhang, Hang Su
PAMI
2008
154views more  PAMI 2008»
15 years 6 months ago
Mutual Information for Lucas-Kanade Tracking (MILK): An Inverse Compositional Formulation
Mutual Information (MI) is popular for registration via function optimization. This work proposes an inverse compositional formulation of MI for Levenberg-Marquardt optimization. T...
Nicholas Dowson, Richard Bowden