3875 search results - page 445 / 775 » Approximation algorithms for the 0-extension problem |
163
click to vote
IJCAI
1997
15 years 8 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
162
click to vote
ALGOSENSORS
2007
Springer
16 years 28 days ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
155
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
166
Voted
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
169
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...