1508 search results - page 133 / 302 » Efficient Path Profiling |
99
Voted
WIOPT
2010
IEEE
15 years 14 days ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
196
click to vote
ECCV
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
133
click to vote
ITIIS
2010
14 years 9 months ago
2010
In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic ...
131
Voted
MOBIHOC
2004
ACM
16 years 2 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
198
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...