5115 search results - page 407 / 1023 » On Randomized Lanczos Algorithms |
252
click to vote
TMC
2008
15 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
240
click to vote
TWC
2008
15 years 7 months ago
2008
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
177
click to vote
AUSAI
2007
Springer
16 years 1 months ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
207
click to vote
EVOW
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
172
click to vote
ICDCS
2010
IEEE
15 years 11 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...