5022 search results - page 195 / 1005 » Data structures and problem solving using Java |
139
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— Network reconstruction, i.e. obtaining network structure from input-output information, is a central theme in systems biology. A variety of approaches aim to obtaining structur...
129
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
122
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
103
click to vote
PAKDD
2010
ACM
15 years 7 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...