Sciweavers

1429 search results - page 125 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
AUTOMATICA
2011
13 years 4 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
DAC
1996
ACM
14 years 1 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
14 years 2 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu
UAI
2003
13 years 10 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins
VRML
2000
ACM
14 years 1 months ago
A spatial hierarchical compression method for 3D streaming animation
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
Toshiki Hijiri, Kazuhiro Nishitani, Tim Cornish, T...