2516 search results - page 440 / 504 » When is there a representer theorem |
242
click to vote
ECCC
2011
15 years 1 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
182
click to vote
TON
2010
15 years 28 days ago
2010
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
173
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
225
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
195
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...