Sciweavers

474 search results - page 51 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
PODC
2006
ACM
14 years 1 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
14 years 1 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
DCOSS
2007
Springer
14 years 2 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»
13 years 7 months 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...
VC
2008
102views more  VC 2008»
13 years 7 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...