450 search results - page 60 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
116
Voted
AIPS
2009
15 years 3 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
104
click to vote
ICIP
2010
IEEE
14 years 12 months ago
2010
IEEE
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
102
Voted
AAAI
2008
15 years 4 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
116
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...