3055 search results - page 351 / 611 » Randomized Search Trees |
127
click to vote
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
128
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
117
click to vote
CEC
2003
IEEE
15 years 9 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
139
click to vote
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
Information retrieval (IR) researchers commonly use three tests of statistical significance: the Student's paired t-test, the Wilcoxon signed rank test, and the sign test. Ot...
153
click to vote
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...