Sciweavers

5595 search results - page 695 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CORR
2011
Springer
208views Education» more  CORR 2011»
15 years 1 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
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
INFOCOM
2009
IEEE
16 years 1 months ago
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates
Abstract—Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries and their expected market...
Cheng-Hsin Hsu, Mohamed Hefeeda
CVPR
2003
IEEE
16 years 9 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick