Sciweavers

118 search results - page 19 / 24
» Approximation Schemes for Euclidean k-Medians and Related Pr...
Sort
View
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 8 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
AIPS
2008
13 years 9 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
ACCV
2007
Springer
14 years 1 months ago
Fast 3-D Interpretation from Monocular Image Sequences on Large Motion Fields
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
Jong-Sung Kim, Ki-Sang Hong
FOCS
2002
IEEE
14 years 13 days ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...