Sciweavers

688 search results - page 43 / 138
» Types for trees
Sort
View
ICML
2004
IEEE
16 years 1 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
111
Voted
RECOMB
2007
Springer
16 years 1 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 5 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
16 years 2 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref
AVI
2006
15 years 2 months ago
Navigation in degree of interest trees
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
Raluca Budiu, Peter Pirolli, Michael Fleetwood