Sciweavers

917 search results - page 121 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ML
2008
ACM
222views Machine Learning» more  ML 2008»
15 years 6 months ago
Boosted Bayesian network classifiers
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
Yushi Jing, Vladimir Pavlovic, James M. Rehg
182
Voted
GECCO
2010
Springer
338views Optimization» more  GECCO 2010»
15 years 4 months ago
Multiobjective evolutionary community detection for dynamic networks
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
Francesco Folino, Clara Pizzuti
167
Voted
ISSTA
2000
ACM
15 years 10 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
154
Voted
OOPSLA
2009
Springer
16 years 20 days ago
The design of a task parallel library
The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delega...
Daan Leijen, Wolfram Schulte, Sebastian Burckhardt
EGH
2009
Springer
15 years 3 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens