Sciweavers

3422 search results - page 34 / 685
» Random Subset Optimization
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 6 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
DCOSS
2006
Springer
15 years 5 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
WIAMIS
2009
IEEE
15 years 8 months ago
Optimizing strategies for the exploration of social networks and associated data collections
Multimedia data collections immersed into social networks may be explored from the point of view of varying documents and users characteristics. In this paper, we develop a unifi...
Stéphane Marchand-Maillet, Eniko Szekely, E...
CIARP
2008
Springer
15 years 3 months ago
Feature Selection through Dynamic Mesh Optimization
This paper introduces the Dynamic Mesh Optimization meta-heuristic, which falls under the evolutionary computation techniques. Moreover, we outline its application to the feature s...
Rafael Bello, Amilkar Puris, Rafael Falcón,...
DEDS
2002
86views more  DEDS 2002»
15 years 1 months ago
On an Optimization Problem in Sensor Selection*
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
Rami Debouk, Stéphane Lafortune, Demostheni...