Sciweavers

360 search results - page 20 / 72
» Timing Minimization by Statistical Timing hMetis-based Parti...
Sort
View
SSIAI
2002
IEEE
14 years 14 days ago
A Wavelet Filter Bank Which Minimizes a Novel Translation Invariant Discrete Uncertainty Measure
We develop a novel measure of joint time-frequency localization applicable to equivalence classes of finite-length discrete signals, which are of increasing importance in modern ...
Peter C. Tay, Joseph P. Havlicek, Victor E. DeBrun...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 8 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ICML
2008
IEEE
14 years 8 months ago
Structure compilation: trading structure for features
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
Dan Klein, Hal Daumé III, Percy Liang
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
13 years 11 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
CODES
2009
IEEE
14 years 2 months ago
On compile-time evaluation of process partitioning transformations for Kahn process networks
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
Sjoerd Meijer, Hristo Nikolov, Todor Stefanov