Sciweavers

4110 search results - page 512 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ICC
2008
IEEE
159views Communications» more  ICC 2008»
16 years 1 months ago
Link Scheduling and Power Control in Wireless Mesh Networks with Directional Antennas
— Directional antennas are very attractive in Wireless Mesh Networks (WMN). We study the problem of link scheduling and power control in a Time-Division Multiple Access (TDMA) WM...
Vishwanath Ramamurthi, Abu Ahmed Reaz, Sudhir S. D...
JDCTA
2010
272views more  JDCTA 2010»
15 years 1 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
JMLR
2010
187views more  JMLR 2010»
15 years 1 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
COMPGEOM
2007
ACM
15 years 10 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 10 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...