777 search results - page 49 / 156 » A fast algorithm for the computation of an upper bound on th... |
HAPTICS
2002
IEEE
14 years 17 days ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
HYBRID
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
RTCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...