Sciweavers

162 search results - page 5 / 33
» Improved Parameterized Algorithms for the Kemeny Aggregation...
Sort
View
25
Voted
WINET
2010
159views more  WINET 2010»
13 years 5 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
SGP
2003
13 years 8 months ago
Global Conformal Parameterization
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
Xianfeng Gu, Shing-Tung Yau
CEC
2005
IEEE
14 years 1 months ago
Performance of aggregation pheromone system on unimodal and multimodal problems
This paper describes and analyzes the aggregation pheromone system (APS) algorithm, which extends ant colony optimization (ACO) to continuous domains. APS uses the collective behav...
Shigeyoshi Tsutsui, Martin Pelikan, Ashish Ghosh
ICASSP
2010
IEEE
13 years 6 months ago
Learning in Gaussian Markov random fields
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
Thomas J. Riedl, Andrew C. Singer, Jun Won Choi
IWPEC
2009
Springer
14 years 2 months ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...