Sciweavers

66 search results - page 10 / 14
» Generating exact D-optimal designs for polynomial models
Sort
View
ISLPED
1997
ACM
114views Hardware» more  ISLPED 1997»
15 years 1 months ago
Cycle-accurate macro-models for RT-level power analysis
 In this paper we present a methodology and techniques for generating cycle-accurate macro-models for RTlevel power analysis. The proposed macro-model predicts not only...
Qinru Qiu, Qing Wu, Massoud Pedram, Chih-Shun Ding
COLT
2006
Springer
15 years 1 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
GIAE
2004
Springer
136views Mathematics» more  GIAE 2004»
15 years 2 months ago
Implicit Reduced Involutive Forms and Their Application to Engineering Multibody Systems
Abstract. The RifSimp package in Maple transforms a set of differential equations to Reduced Involutive Form. This paper describes the application of RifSimp to challenging real-w...
Wenqin Zhou, David J. Jeffrey, Gregory J. Reid, Ch...
152
Voted
CP
2009
Springer
15 years 10 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...