Sciweavers

455 search results - page 48 / 91
» Dynamic well-spaced point sets
Sort
View
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
14 years 2 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
ICALP
2003
Springer
15 years 5 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
ICCV
2003
IEEE
16 years 1 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
SIAMCO
2002
121views more  SIAMCO 2002»
14 years 11 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
DCOSS
2009
Springer
15 years 6 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...