312 search results - page 34 / 63 » An experimental study on algorithms for drawing binary trees |
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
DAGSTUHL
2004
13 years 9 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
TCSV
2008
13 years 7 months ago
2008
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...