Sciweavers

29 search results - page 4 / 6
» Lower bounds for linear degeneracy testing
Sort
View
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 4 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 28 days ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
INFOCOM
2005
IEEE
13 years 12 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
13 years 11 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 11 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen