Sciweavers

2721 search results - page 371 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
TASLP
2010
118views more  TASLP 2010»
15 years 4 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...
TSE
2010
151views more  TSE 2010»
15 years 4 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
15 years 4 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
GECCO
2009
Springer
16 years 1 months ago
On the performance effects of unbiased module encapsulation
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Oz...
ECLIPSE
2006
ACM
16 years 14 days ago
HAM: cross-cutting concerns in Eclipse
As programs evolve, newly added functionality sometimes no longer aligns with the original design, ending up scattered across the software system. Aspect mining tries to identify ...
Silvia Breu, Thomas Zimmermann, Christian Lindig