Sciweavers

9871 search results - page 63 / 1975
» On the Structure of Low Sets
Sort
View
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 3 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
INFOVIS
2005
IEEE
14 years 2 months ago
Low-Level Components of Analytic Activity in Information Visualization
Existing system-level taxonomies of visualization tasks are geared more towards the design of particular representations than the facilitation of user analytic activity. We presen...
Robert A. Amar, James Eagan, John T. Stasko
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
13 years 8 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
ICML
2000
IEEE
14 years 9 months ago
Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets
We introduce an expandable Bayesian network (EBN) to handle the combination of diverse multiple homogeneous evidence sets. An EBN is an augmented Bayesian network which instantiat...
Zu Whan Kim, Ramakant Nevatia
ESOP
2000
Springer
14 years 18 days ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne