Sciweavers

3894 search results - page 541 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 3 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
MOBIHOC
2010
ACM
15 years 1 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
SIAMCO
2010
97views more  SIAMCO 2010»
14 years 10 months ago
Real-Time Nonlinear Optimization as a Generalized Equation
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
Victor M. Zavala, Mihai Anitescu
MMAS
2011
Springer
14 years 6 months ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying
EMMCVPR
2011
Springer
14 years 3 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko