3192 search results - page 180 / 639 » The minimum latency problem |
120
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
132
click to vote
AICCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...
116
click to vote
ISMIR
2004
Springer
15 years 9 months ago
2004
Springer
We motivate the problem of music recommendation based solely on acoustics from groups of related songs or ‘song sets’. We propose four solutions which can be used with any aco...
127
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
133
Voted
DAM
2008
15 years 4 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...