219 search results - page 23 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
191
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
121
Voted
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
114
Voted
ISCA
2003
IEEE
15 years 5 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
RTSS
2000
IEEE
15 years 4 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
105
click to vote
RTAS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper focuses on a technique to empower commercial-off-the-shelf (COTS) systems with an execution environment, and corresponding services, to support realtime and embedded ap...