Sciweavers

752 search results - page 74 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
PG
2007
IEEE
15 years 9 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
15 years 2 months ago
Approximating the Domatic Number
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
Uriel Feige, Magnús M. Halldórsson, ...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 3 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
116
Voted
ADHOCNOW
2003
Springer
15 years 8 months ago
Topology Control Problems under Symmetric and Asymmetric Power Thresholds
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madha...
MST
2010
187views more  MST 2010»
14 years 10 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda