1480 search results - page 113 / 296 » Distributed algorithms for weighted problems in sparse graph... |
106
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
102
Voted
SYNASC
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
109
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
93
Voted
CCCG
2007
15 years 2 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
PAMI
2010
14 years 11 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...