Sciweavers

1017 search results - page 73 / 204
» On the Power of k -Consistency
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Identification and compensation of Wiener-Hammerstein systems with feedback
Efficient operation of RF power amplifiers requires compensation strategies to mitigate nonlinear behavior. As bandwidth increases, memory effects become more pronounced, and Vo...
Andrew K. Bolstad, Benjamin A. Miller, Joel Goodma...
CP
2000
Springer
15 years 9 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CSDA
2008
102views more  CSDA 2008»
15 years 6 months ago
Step-up and step-down procedures controlling the number and proportion of false positives
In multiple hypotheses testing, it is important to control the probability of rejecting "true" null hypotheses. A standard procedure has been to control the family-wise ...
Paul N. Somerville, Claudia Hemmelmann
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 6 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
16 years 23 days ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh