Sciweavers

3894 search results - page 277 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
OL
2007
156views more  OL 2007»
15 years 6 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
ICTAI
2006
IEEE
16 years 20 days ago
An Approximation to Mean-Shift via Swarm Intelligence
Mean shift based feature space analysis has been shown to be an elegant, accurate and robust technique. The elegance in this non-parametric algorithm is mainly due to its simplici...
Mani Thomas, Chandra Kambhamettu
ICML
2009
IEEE
16 years 7 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
16 years 20 days ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson