4131 search results - page 59 / 827 » Compactness in Topology and Computation |
181
click to vote
DNA
2007
Springer
16 years 9 days ago
2007
Springer
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
152
click to vote
UIST
2005
ACM
15 years 11 months ago
2005
ACM
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
154
click to vote
CIARP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
149
click to vote
LCPC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
151
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...