1491 search results - page 227 / 299 » Training Linear Discriminant Analysis in Linear Time |
PODC
2010
ACM
14 years 23 days ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
ESA
2006
Springer
14 years 16 days ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
SAS
1997
Springer
14 years 13 days ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
GLVLSI
2010
IEEE
13 years 11 months ago
2010
IEEE
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
DEDS
2010
13 years 9 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...