Sciweavers

219 search results - page 23 / 44
» Time and Space Lower Bounds for Implementations Using k-CAS
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 8 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
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...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 8 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
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....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
ISCA
2003
IEEE
169views Hardware» more  ISCA 2003»
14 years 1 months ago
Virtual Simple Architecture (VISA): Exceeding the Complexity Limit in Safe Real-Time Systems
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...
Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, ...
RTSS
2000
IEEE
14 years 1 months ago
Scalable Real-Time System Design using Preemption Thresholds
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
Manas Saksena, Yun Wang
RTAS
2007
IEEE
14 years 2 months ago
Hijack: Taking Control of COTS Systems for Real-Time User-Level Services
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...
Gabriel Parmer, Richard West