4041 search results - page 154 / 809 » time 2009 |
178
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
186
click to vote
CSFW
2009
IEEE
16 years 1 months ago
2009
IEEE
Timeout mechanisms are a useful feature for web applications. However, these mechanisms need to be used with care because, if used as-is, they are vulnerable to timing attacks. Th...
187
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
170
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
143
click to vote
ICCBR
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we revisit the trade-off between adaptation and retrieval effort traditionally held as a principle in case-based reasoning. This principle states that the time needed...