5595 search results - page 295 / 1119 » Approximation Algorithms for Clustering Problems |
187
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
179
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
209
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
132
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
190
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...