642 search results - page 53 / 129 » Approximation Algorithms for Minimum K-Cut |
100
click to vote
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
105
click to vote
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ESANN
2000
15 years 1 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
107
click to vote
CATS
2006
15 years 1 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...