Sciweavers

219 search results - page 17 / 44
» Optimal dyadic decision trees
Sort
View
IUI
2009
ACM
14 years 7 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 10 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
WOB
2004
13 years 11 months ago
A Multi-Neighbor-Joining Approach for Phylogenetic Tree Reconstruction and Visualization
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
Ana Estela Antunes da Silva, Wilfredo J. Puma-Vill...
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 5 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...