10051 search results - page 369 / 2011 » A Dynamic Separator Algorithm |
226
Voted
ICPPW
2002
IEEE
16 years 12 days ago
2002
IEEE
In large networks, maintaining precise global network state information is almost impossible. Many factors, such as non-negligible propagation delay, infrequent state updates due ...
205
click to vote
PRICAI
1998
Springer
15 years 11 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
225
Voted
WSCG
2003
15 years 8 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
197
Voted
CGF
2008
15 years 7 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
232
click to vote
PRL
2006
15 years 7 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...