Sciweavers

1364 search results - page 76 / 273
» Collective Optimization
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 9 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
ISPAN
2005
IEEE
14 years 3 months ago
An Efficient MPI-IO for Noncontiguous Data Access over InfiniBand
Noncontiguous data access is a very common access pattern in many scientific applications. Using POSIX I/O to access many pieces of noncontiguous data segments will generate a lot...
Ding-Yong Hong, Ching-Wen You, Yeh-Ching Chung
ISVC
2009
Springer
14 years 4 months ago
Deformable 2D Shape Matching Based on Shape Contexts and Dynamic Programming
This paper presents a method for matching closed, 2D shapes (2D object silhouettes) that are represented as an ordered collection of shape contexts [1]. Matching is performed using...
Iasonas Oikonomidis, Antonis A. Argyros
MOBICOM
2009
ACM
14 years 4 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 years 4 months ago
Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
Ruoming Jin, Gagan Agrawal