Sciweavers

845 search results - page 128 / 169
» Complexity Dimensions and Learnability
Sort
View
COMPGEOM
1991
ACM
14 years 9 hour ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
FM
1991
Springer
164views Formal Methods» more  FM 1991»
14 years 7 hour ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin
VISSYM
2007
13 years 11 months ago
Dimensional Congruence for Interactive Visual Data Mining and Knowledge Discovery
Many authors in the field of 3D human computer interaction have described the advantages of 3D user interfaces: Intuitive metaphors from daily life, immersive workspaces, virtual ...
Sebastian Baumgärtner, Achim Ebert, Matthias ...
CANDC
2005
ACM
13 years 10 months ago
Distances and diversity: sources for social creativity
The power of the unaided, individual mind is highly overrated: The Renaissance scholar no longer exists. Although creative individuals are often thought of as working in isolation...
Gerhard Fischer
ICALP
2010
Springer
13 years 10 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou