Sciweavers

2373 search results - page 421 / 475
» On the Theory of Structural Subtyping
Sort
View
CCA
2009
Springer
15 years 1 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
COMPGEOM
2007
ACM
15 years 1 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
AI50
2006
15 years 1 months ago
The iCub  Cognitive Humanoid Robot: An Open-System Research Platform for Enactive Cognition
Abstract. This paper describes a multi-disciplinary initiative to promote collaborative research in enactive artificial cognitive systems by developing the iCub : a open-systems 53...
Giulio Sandini, Giorgio Metta, David Vernon
DNA
2006
Springer
146views Bioinformatics» more  DNA 2006»
15 years 1 months ago
On Times to Compute Shapes in 2D Tile Self-assembly
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...