Sciweavers

2182 search results - page 276 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
115
Voted
CSUR
2000
69views more  CSUR 2000»
15 years 2 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
123
Voted
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 6 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
114
Voted
PIMRC
2008
IEEE
15 years 9 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
159
Voted
ICCV
2011
IEEE
14 years 2 months ago
Dynamic Manifold Warping for View Invariant Action Recognition
We address the problem of learning view-invariant 3D models of human motion from motion capture data, in order to recognize human actions from a monocular video sequence with arbi...
Dian Gong, Gerard Medioni
132
Voted
ICALP
2009
Springer
16 years 2 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...