Sciweavers

847 search results - page 67 / 170
» Approximation algorithms for projective clustering
Sort
View
96
Voted
PODC
2006
ACM
15 years 6 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
IUI
2003
ACM
15 years 5 months ago
Summarizing archived discussions: a beginning
This paper describes an approach to digesting threads of archived discussion lists by clustering messages into approximate topical groups, and then extracting shorter overviews, a...
Paula S. Newman, John C. Blitzer
104
Voted
DCOSS
2007
Springer
15 years 6 months 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...
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 14 days ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
127
Voted
CVPR
2007
IEEE
16 years 2 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...