Gaussian distributions lie at the heart of popular tools for capturing structure in high dimensional data. Standard techniques employ as models arbitrary linear transformations of spherical Gaussians. In this paper, we present a simple extension to a class of non{ linear, volume preserving transformations which provides an e cient local description of curvature. The resulting generalized Gaussi...

We consider weak Gabriel drawings of unbounded degree trees in the three-dimensional space. We assume a minimum distance between any two vertices. Under the same assumption, there exists an exponential area lower bound for general graphs. Moreover, all previously known algorithms to construct (weak) proximity drawings of trees, generally produce exponential area layouts, even when we restrict o...

Creating new concepts from data is a hard problem in the development of cognitive architectures, but one that must be solved for the BICA community to declare success. Two concept generation algorithms are presented here that are appropriate to different levels of concept abstraction: statespace partitioning with decision trees and context-based similarity.

In today’s competitive, dynamic, and changing business environment, being able to collaborate globally within and beyond the enterprise borders is critical. Inter-Organizational Collaborations (IOCs) have been proposed as a response to the characteristics of highly competitive global business environments. So far, a number of reference models, frameworks, and ad hoc architectures related to som...

In this paper we introduce temporal action graph games (TAGGs), a novel graphical representation of imperfect-information extensive form games. We show that when a game involves anonymity or context-specific utility independencies, its encoding as a TAGG can be much more compact than its direct encoding as a multiagent influence diagram (MAID). We also show that TAGGs can be understood as indir...

This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of graphs such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of graphs having constant queue number and on k-trees. We present algorithms that compute drawings of these families of graphs on 3D grids consisting of a constant number of paral...

The configuration of systems engineering methods is a challenging task. As a method engineer it is essential to have conceptual constructs capable of reducing the burden of details during method configuration and thus make it possible to create a balance between precision and cost. In this paper we present the method component construct, which seems fruitful for method configuration and meta me...

Method configuration is a specific type of Method Engineering (ME) that takes an existing organizationwide Information Systems Development Method (ISDM) as its point of departure. Existing assembly-based ME approaches are not well suited to this task. As an alternative, this paper suggests a metamethod approach to tailoring organization-wide ISDMs. We refer to this approach as the Method for Me...

The evolution of microprocessor architecture depends upon the changing aspects of technology. As die density and speed increase, memory and program behavior become increasingly important in de ning architecture tradeo s. While technology enables increasingly complex processor implementations, there are physical and program behavior limits to the usefulness of this complexity. Physical limits in...