Result 1 to 20 of 88 total
The binary identification problem for weighted trees. (English)
Theor. Comput. Sci. 459, 100-112 (2012).
1
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. (English)
Kärkkäinen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 149-158 (2012).
2
Informing sequential clinical decision-making through reinforcement learning: an empirical study. (English)
Mach. Learn. 84, No. 1-2, 109-136 (2011).
3
Adaptive confidence intervals for the test error in classification. (English)
J. Am. Stat. Assoc. 106, No. 495, 904-913 (2011).
4
On the complexity of searching in trees and partially ordered structures. (English)
Theor. Comput. Sci. 412, No. 50, 6879-6896 (2011).
5
Binary identification problems for weighted trees. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 255-266 (2011).
6
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case. (English)
Discrete Appl. Math. 159, No. 11, 1070-1078 (2011).
7
On the competitive ratio of evaluating priced functions. (English)
J. ACM 58, No. 3, 9 (2011).
8
An approximation algorithm for binary searching in trees. (English)
Algorithmica 59, No. 4, 601-620 (2011).
9
Special issue: Latin American theoretical informatics (LATIN 2008). Selected papers based on the presentations at the 8th conference, Buzios, Rio de Janeiro, Brazil, April 2008. (English)
Algorithmica 59, No. 1, 114~p. (2011).
10
Improved approximations for the hotlink assignment problem (English)
ACM Transactions on Algorithms 7, No. 3, 39 (2011).
11
Binary identification problems for weighted trees (English)
WADS, 255-266 (2011).
12
An efficient language-independent method to extract content from news webpages (English)
ACM Symposium on Document Engineering, 121-128 (2011).
13
On greedy algorithms for decision trees. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15‒17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 206-217 (2010).
14
On the complexity of searching in trees: Average-case minimization. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 527-539 (2010).
15
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case. (English)
Comput. Res. Repos. 2010, Article No. 1006.4136 (2010).
16
On the complexity of searching in trees: average-case minimization (English)
ICALP (1), 527-539 (2010).
17
On greedy algorithms for decision trees (English)
ISAAC (2), 206-217 (2010).
18
On the complexity of searching in trees: average-case minimization. (English)
Comput. Res. Repos. 2009, Article No. 0904.3503 (2009).
19
A fast and simple method for extracting relevant content from news webpages (English)
CIKM, 1685-1688 (2009).
20
Result 1 to 20 of 88 total
Start
Contact
Print
General Help
