3471 search results - page 239 / 695 » Obstacle Numbers of Graphs |
164
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
161
click to vote
JCO
2007
15 years 5 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
155
Voted
ICASSP
2009
IEEE
15 years 12 months ago
2009
IEEE
We present a factor graph based design of a receiver for pilotassisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative mult...
116
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
125
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...