Sciweavers

632 search results - page 91 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
APCHI
2008
IEEE
16 years 10 days ago
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...
Inyoung Shin, Moonseong Kim, Hyunseung Choo
AISC
2010
Springer
15 years 9 months ago
How to Correctly Prune Tropical Trees
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...
Jean-Vincent Loddo, Luca Saiu
TSP
2008
140views more  TSP 2008»
15 years 5 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick
ICML
2010
IEEE
15 years 7 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 10 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla