1004 search results - page 173 / 201 » A comparison of generalized linear discriminant analysis alg... |
JGO
2010
13 years 3 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In xDSL systems, crosstalk can be separated into two categories, namely in-domain crosstalk and out-of-domain crosstalk. Indomain crosstalk is also refered to as self crosstalk. Ou...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
FPGA
2004
ACM
14 years 10 days ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...