107 search results - page 10 / 22 » Random sampling and approximation of MAX-CSP problems |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
ATAL
2009
Springer
13 years 8 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...