7129 search results - page 472 / 1426 » Approximation Algorithms for Treewidth |
159
click to vote
CIKM
2004
Springer
15 years 12 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
172
click to vote
SIBGRAPI
2003
IEEE
15 years 11 months ago
2003
IEEE
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
202
click to vote
HSNMC
2003
Springer
15 years 11 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
174
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
145
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...