Sciweavers

963 search results - page 73 / 193
» Escape Analysis on Lists
Sort
View
ICFCA
2009
Springer
15 years 7 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
90
Voted
IPPS
2008
IEEE
15 years 7 months ago
Massive supercomputing coping with heterogeneity of modern accelerators
Heterogeneous supercomputers with combined general purpose and accelerated CPUs promise to be the future major architecture due to their wideranging generality and superior perfor...
Toshio Endo, Satoshi Matsuoka
ICSE
2007
IEEE-ACM
15 years 6 months ago
Enhancing Software Testing by Judicious Use of Code Coverage Information
Recently, tools for the analysis and visualization of code coverage have become widely available. At first glance, their value in assessing and improving the quality of automated ...
Stefan Berner, Roland Weber, Rudolf K. Keller
106
Voted
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
15 years 6 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
115
Voted
APSEC
2002
IEEE
15 years 5 months ago
Using Process Simulation to Compare Scheduling Strategies for Software Projects
We present a discrete simulation model for software projects which explicitly takes a scheduling strategy as input. The model represents varying staff skill levels, component coup...
Frank Padberg