10051 search results - page 1682 / 2011 » A Dynamic Separator Algorithm |
175
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
157
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
151
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
147
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
142
click to vote
LCTRTS
2001
Springer
15 years 8 months ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...