Sciweavers

2266 search results - page 201 / 454
» Generalizing parametric timing analysis
Sort
View
JACM
2000
119views more  JACM 2000»
15 years 3 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
SI3D
2006
ACM
15 years 9 months ago
Jump flooding in GPU with applications to Voronoi diagram and distance transform
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
Guodong Rong, Tiow Seng Tan
134
Voted
PDP
2002
IEEE
15 years 8 months ago
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...
Chun-Hua Yang, Geert Deconinck
FMICS
2010
Springer
15 years 4 months ago
Model Checking the FlexRay Physical Layer Protocol
Abstract. The FlexRay standard, developed by a cooperation of leading companies in the automotive industry, is a robust communication protocol for distributed components in modern ...
Michael Gerke 0002, Rüdiger Ehlers, Bernd Fin...
MIR
2005
ACM
129views Multimedia» more  MIR 2005»
15 years 8 months ago
Tracking concept drifting with an online-optimized incremental learning framework
Concept drifting is an important and challenging research issue in the field of machine learning. This paper mainly addresses the issue of semantic concept drifting in time series...
Jun Wu, Dayong Ding, Xian-Sheng Hua, Bo Zhang