Sciweavers

156 search results - page 11 / 32
» AI Space Odyssey
Sort
View
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
15 years 4 days ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka
ICGI
2004
Springer
15 years 3 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 3 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
AIIDE
2007
15 years 20 days ago
Automatic Design of Balanced Board Games
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game pla...
Joe Marks, Vincent Hom
CSCW
2008
ACM
15 years 4 days ago
Asymmetry in media spaces
In any collaborative system, there are both symmetries and asymmetries present in the design of the technology and in the ways that technology is appropriated. Yet media space res...
Amy Voida, Stephen Voida, Saul Greenberg, Helen Ai...