1326 search results - page 200 / 266 » Approximate Tree Kernels |
181
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
139
click to vote
ICML
2009
IEEE
16 years 11 days ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
160
click to vote
FOCS
2009
IEEE
16 years 10 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
193
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
166
click to vote
SIAMDM
2010
15 years 9 days ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...