Sciweavers

135 search results - page 3 / 27
» Efficiently Solving the Fractional Trust Region Problem
Sort
View
CVPR
2007
IEEE
14 years 6 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
JCST
2008
134views more  JCST 2008»
13 years 4 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
JPDC
2006
148views more  JPDC 2006»
13 years 4 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
CVPR
2006
IEEE
14 years 6 months ago
Successive Convex Matching for Action Detection
We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video b...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ISM
2006
IEEE
277views Multimedia» more  ISM 2006»
13 years 4 months ago
Efficient Bottom-Up Image Segmentation Using Region Competition and the Mumford-Shah Model for Color and Textured Images
Curve evolution implementations [3][23] [25] of the Mumford-Shah functional [16] are of broad interest in image segmentation. These implementations, however, have initialization p...
Yongsheng Pan, J. Douglas Birdwell, Seddik M. Djou...