2152 search results - page 105 / 431 » A Comparative Study of 2QBF Algorithms |
125
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
127
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
The prevailing approach to evaluating classifiers in the machine learning community involves comparing the performance of several algorithms over a series of usually unrelated data...
152
click to vote
BVAI
2005
Springer
15 years 9 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
148
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
137
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...