705 search results - page 125 / 141 » Approximating Extended Answer Sets |
80
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach ...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
WIA
2009
Springer
15 years 4 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
MOBILWARE
2009
ACM
15 years 4 months ago
2009
ACM
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...
ECRTS
2005
IEEE
15 years 3 months ago
2005
IEEE
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...