800 search results - page 111 / 160 » Effective Prediction and its Computational Complexity |
PERCOM
2006
ACM
14 years 9 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
RTSS
2008
IEEE
14 years 4 months ago
2008
IEEE
Many embedded systems are subject to temporal constraints that require advance guarantees on meeting deadlines. Such systems rely on static analysis to safely bound worst-case exe...
APPT
2007
Springer
14 years 4 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
WMPI
2004
ACM
14 years 3 months ago
2004
ACM
Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization ...
TVCG
2011
13 years 5 months ago
2011
—This paper presents a study of gradient estimation methods for rendering unstructured-mesh volume data. Gradient estimation is necessary for rendering shaded isosurfaces and spe...