Sciweavers

4131 search results - page 47 / 827
» Compactness in Topology and Computation
Sort
View
FOCS
2000
IEEE
15 years 5 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
DATE
2000
IEEE
75views Hardware» more  DATE 2000»
15 years 6 months ago
Layout Compaction for Yield Optimization via Critical Area Minimization
This paper presents a new compaction algorithm to improve the yield of IC layout. The yield is improved by reducing the area where the faults are more likely to happen known as cr...
Youcef Bourai, C.-J. Richard Shi
TCS
2008
15 years 1 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
EUROPAR
2004
Springer
15 years 7 months ago
A Proxy Server-Network for Real-Time Computer Games
Abstract. Computer games played over the Internet have recently become an important class of distributed applications. In this paper we present a novel proxy server-network topolog...
Jens Müller 0004, Stefan Fischer, Sergei Gorl...
DNA
2005
Springer
134views Bioinformatics» more  DNA 2005»
15 years 7 months ago
Complexity of Compact Proofreading for Self-assembled Patterns
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
David Soloveichik, Erik Winfree