6315 search results - page 294 / 1263 » Approximating Solution Structure |
161
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
195
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract--This paper focuses on the way to achieve accurate visual servoing tasks when the shape of the object being observed as well as the desired image are unknown. More precise...
202
click to vote
CGF
2010
15 years 5 months ago
2010
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
196
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
177
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract—This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...