Sciweavers

3958 search results - page 374 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
AAAI
1994
15 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
CISS
2010
IEEE
14 years 10 months ago
Self-organizing Dynamic Fractional Frequency Reuse on the uplink of OFDMA systems
Reverse link (or uplink) performance of cellular systems is becoming increasingly important with the emergence of new uplink-bandwidth intensive applications such as Video Share [...
Balaji Rengarajan, Alexander L. Stolyar, Harish Vi...
IPPS
2008
IEEE
16 years 1 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
16 years 1 months ago
Incremental Subspace Clustering over Multiple Data Streams
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
Qi Zhang, Jinze Liu, Wei Wang 0010
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
16 years 6 hour ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec