Sciweavers

1151 search results - page 48 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
CVPR
2001
IEEE
14 years 11 months ago
A Bayesian Approach to Digital Matting
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel ...
Yung-Yu Chuang, Brian Curless, David Salesin, Rich...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 9 months ago
Optimal power allocation for downstream xDSL with per-modem total power constraints : Broadcast Channel Optimal Spectrum Balanci
Abstract-Recently, the duality between Multiple Input Multiple Output (MIMO) Multiple Access Channels (MAC) and MIMO Broadcast Channels (BC) has been established under a total powe...
Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun...
COMPUTE
2010
ACM
14 years 1 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
TVLSI
2008
151views more  TVLSI 2008»
13 years 8 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan