6740 search results - page 477 / 1348 » An s -Hamiltonian Line Graph Problem |
145
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
239
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
171
click to vote
ISCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
170
click to vote
PERCOM
2008
ACM
16 years 1 months ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
190
click to vote
SYNASC
2008
IEEE
16 years 1 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...