917 search results - page 121 / 184 » Comparison of Data Structures for Computing Formal Concepts |
100
click to vote
ML
2008
ACM
14 years 9 months ago
2008
ACM
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
GECCO
2010
Springer
14 years 8 months ago
2010
Springer
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...
ISSTA
2000
ACM
15 years 2 months ago
2000
ACM
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...
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
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...
EGH
2009
Springer
14 years 7 months ago
2009
Springer
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...