Sciweavers

433 search results - page 58 / 87
» A greedy approximation algorithm for the group Steiner probl...
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
ALGOSENSORS
2007
Springer
14 years 2 months ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ICML
2006
IEEE
14 years 9 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ESANN
2003
13 years 10 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 2 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang