7930 search results - page 1301 / 1586 » Greedy in Approximation Algorithms |
158
Voted
ICWN
2007
15 years 6 months ago
2007
—To meet the demand for broadband wireless communication, wireless systems should work well in typical wireless environments, characterized by the path loss of the signals, multi...
148
click to vote
IJCAI
2007
15 years 6 months ago
2007
Statistical relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. We previously introduced view learnin...
127
click to vote
IJCAI
2007
15 years 6 months ago
2007
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
146
click to vote
NIPS
2008
15 years 6 months ago
2008
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
132
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...