Sciweavers

2095 search results - page 222 / 419
» Improved pebbling bounds
Sort
View
ASPDAC
2008
ACM
174views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Chebyshev Affine Arithmetic based parametric yield prediction under limited descriptions of uncertainty
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
Jin Sun, Yue Huang, Jun Li, Janet Meiling Wang
NETWORKING
2007
15 years 8 months ago
Characterizing the Capacity Gain of Stream Control Scheduling in MIMO Wireless Mesh Networks
Stream control has recently attracted attentions in the research of MIMO wireless networks as a potential way to improve network capacity. However, inappropriate use of stream cont...
Yue Wang, Dah-Ming Chiu, John C. S. Lui
VMV
2001
160views Visualization» more  VMV 2001»
15 years 8 months ago
Interactive Repositioning of Bone Fracture Segments
This paper presents an application for semiautomatic repositioning of bone fractures that allows the merging of several fragments. This application has been developed with regard ...
Michael Scheuering, Christof Rezk-Salama, Christia...
AAAI
1993
15 years 8 months ago
Numerical Behavior Envelopes for Qualitative Models
Semiquantitative models combine both qualitative and quantitative knowledge within a single semiquantitative qualitative differential equation (SQDE) representation. With current ...
Herbert Kay, Benjamin Kuipers
CCR
2008
94views more  CCR 2008»
15 years 6 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...