Sciweavers

312 search results - page 8 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
COMPGEOM
2003
ACM
14 years 22 days ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
IV
2005
IEEE
81views Visualization» more  IV 2005»
14 years 1 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
IJCNN
2000
IEEE
13 years 12 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
RECOMB
2011
Springer
12 years 10 months ago
Algorithms for MDC-Based Multi-locus Phylogeny Inference
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
Yun Yu, Tandy Warnow, Luay Nakhleh