Sciweavers

1632 search results - page 151 / 327
» On special numberings of hypergraphs
Sort
View
JCT
2011
84views more  JCT 2011»
15 years 1 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
TCS
2011
15 years 1 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon
TSP
2011
125views more  TSP 2011»
15 years 1 months ago
Weight Adjusted Tensor Method for Blind Separation of Underdetermined Mixtures of Nonstationary Sources
—In this paper, a novel algorithm to blindly separate an instantaneous linear underdetermined mixture of nonstationary sources is proposed. It means that the number of sources ex...
Petr Tichavský, Zbynek Koldovský
TKDE
2010
149views more  TKDE 2010»
15 years 1 months ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
14 years 10 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...