4865 search results - page 401 / 973 » The Complexity of Graph Connectivity |
214
Voted
HAPTICS
2010
IEEE
15 years 4 months ago
2010
IEEE
Interactions with virtual worlds using the sense of touch, called haptic rendering, have natural applications in many domains such as health or industry. For an accurate and realis...
203
click to vote
ICASSP
2009
IEEE
16 years 1 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...
164
click to vote
ICASSP
2008
IEEE
16 years 1 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 ...
184
click to vote
ISAAC
2003
Springer
16 years 17 hour ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
177
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...