Sciweavers

3946 search results - page 328 / 790
» The computational complexity of choice sets
Sort
View
COMGEO
2004
ACM
15 years 6 months ago
Minimal enclosing parallelepiped in 3D
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
Frédéric Vivien, Nicolas Wicker
HCI
2009
15 years 4 months ago
An Empirical Analysis of Personal Digital Document Structures
Hierarchies have long been used as useful structuring mechanisms for organizing and managing documents. This study looks at the problem of personal digital document management in t...
Sarah Henderson, Ananth Srinivasan
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DALT
2008
Springer
15 years 8 months ago
Strategic Agent Communication: An Argumentation-Driven Approach
Abstract. This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based ...
Jamal Bentahar, Mohamed Mbarki, John-Jules Ch. Mey...
COLING
2000
15 years 8 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne