334 search results - page 17 / 67 » Improved Algorithms and Complexity Results for Power Dominat... |
IEICET
2008
13 years 7 months ago
2008
Finite impulse response (FIR) filtering is the most computationally intensive operation in the channelizer of a wireless communication receiver. Higher order FIR channel filters a...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
CIAC
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...