Sciweavers

14161 search results - page 284 / 2833
» On generalized middle-level problem
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 8 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 8 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
FLAIRS
2004
15 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
AMC
2007
125views more  AMC 2007»
15 years 6 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
COR
2010
127views more  COR 2010»
15 years 6 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...