Sciweavers

373 search results - page 60 / 75
» On Deterministic Approximation of DNF
Sort
View
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 6 months ago
Practical, fast Monte Carlo statistical static timing analysis: why and how
Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the appr...
Amith Singhee, Sonia Singhal, Rob A. Rutenbar
WIA
2009
Springer
14 years 4 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic ļ¬nite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ļ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
LCN
2008
IEEE
14 years 4 months ago
Efficient power management for Wireless Sensor Networks: A data-driven approach
ā€”Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
MingJian Tang, Jinli Cao, Xiaohua Jia
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
COCOON
2007
Springer
14 years 3 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of SzemerĀ“edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav