Sciweavers

16093 search results - page 369 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
COMGEO
1999
ACM
15 years 6 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
15 years 4 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
TCOM
2010
116views more  TCOM 2010»
15 years 5 months ago
Optimal Routing for Decode-Forward in Cooperative Wireless Networks
Abstract—We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
Lawrence Ong, Mehul Motani
CEC
2007
IEEE
16 years 1 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao
ANOR
2010
112views more  ANOR 2010»
15 years 5 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal