4926 search results - page 261 / 986 » Two Graph Algorithms On an Associative Computing Model |
177
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
180
click to vote
JMIV
2010
15 years 4 months ago
2010
: In this paper, we are interested in texture modeling with functional analysis spaces. We focus on the case of color image processing, and in particular color image decomposition....
173
click to vote
DAGSTUHL
2003
15 years 7 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
192
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Grids are very complex and volatile infrastructures that exhibit parallel and distributed characteristics. To harness their complexity as well as the increasing intricacy...
140
click to vote
IPPS
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...