1952 search results - page 373 / 391 » Complete partitions of graphs |
143
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
157
click to vote
ALMOB
2006
15 years 4 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
142
click to vote
JCIT
2008
15 years 4 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
132
click to vote
CACM
1998
15 years 4 months ago
1998
Abstract. The Virtual Reality Modeling Language (VRML) and Java provide a standardized, portable and platformindependent way to render dynamic, interactive 3D scenes across the Int...
141
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...