5595 search results - page 698 / 1119 » Approximation Algorithms for Clustering Problems |
172
Voted
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
194
click to vote
WAOA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
174
Voted
CRV
2007
IEEE
15 years 10 months ago
2007
IEEE
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
177
click to vote
NIPS
2007
15 years 8 months ago
2007
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
137
click to vote
WSC
2000
15 years 8 months ago
2000
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...