Sciweavers

2600 search results - page 131 / 520
» Clustering with or without the Approximation
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
ICRA
2007
IEEE
170views Robotics» more  ICRA 2007»
16 years 22 days ago
Space-time A Contrario Clustering for Detecting Coherent Motions
Abstract— This paper presents a method for detecting independent temporally-persistent motion patterns in image sequences. The result is a description of the dynamic content of a...
Thomas Veit, Frédéric Cao, Patrick B...
DCOSS
2007
Springer
16 years 18 days ago
Optimal Cluster Association in Two-Tiered Wireless Sensor Networks
Abstract. In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall net...
Weizhao Wang, Wen-Zhan Song, Xiang-Yang Li, Kousha...
ICDM
2003
IEEE
112views Data Mining» more  ICDM 2003»
15 years 11 months ago
Privacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
Srujana Merugu, Joydeep Ghosh
AAAI
2007
15 years 8 months ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...