4201 search results - page 487 / 841 » Interaction graphs: Additives |
224
click to vote
FOCS
2002
IEEE
16 years 12 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
267
Voted
CDC
2009
IEEE
16 years 5 days ago
2009
IEEE
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
200
Voted
PACT
2009
Springer
16 years 10 hour ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
220
click to vote
SCIA
2009
Springer
15 years 12 months ago
2009
Springer
In this paper we describe a dense motion segmentation method for wide baseline image pairs. Unlike many previous methods our approach is able to deal with deforming motions and lar...
198
click to vote
FPL
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. Visual data
ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal
ow gra...