Sciweavers

9716 search results - page 346 / 1944
» The Case for Energy-Proportional Computing
Sort
View
IPL
2002
107views more  IPL 2002»
15 years 6 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya
TIT
2002
95views more  TIT 2002»
15 years 6 months ago
Mutual information approach to blind separation of stationary sources
This paper presents a unified approach to the problem of blind separation of sources, based on the concept of mutual information. This concept is applied to the whole source sequen...
Dinh-Tuan Pham
COLOGNETWENTE
2010
15 years 5 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
JAR
2010
100views more  JAR 2010»
15 years 5 months ago
Geometry Constructions Language
We give a short survey of the main principles of our software for the visualisation and animation in mathematics and study the visibility and contour problems in the representation...
Predrag Janicic
MSCS
2010
104views more  MSCS 2010»
15 years 5 months ago
A note on accelerated Turing machines
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
Cristian S. Calude, Ludwig Staiger