2766 search results - page 331 / 554 » Algorithms for trigonometric polynomials |
140
click to vote
IJCAI
2007
15 years 6 months ago
2007
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
139
click to vote
PLANX
2008
15 years 6 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
133
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
123
click to vote
IJCAI
2001
15 years 6 months ago
2001
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
132
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...