Sciweavers

526 search results - page 51 / 106
» Improved Decomposition of STGs
Sort
View
VTS
1998
IEEE
87views Hardware» more  VTS 1998»
14 years 2 months ago
Fast Self-Recovering Controllers
A fast fault-tolerant controller structure is presented, which is capable of recovering from transient faults by performing a rollback operation in hardware. The proposed fault-to...
Andre Hertwig, Sybille Hellebrand, Hans-Joachim Wu...
FCT
1995
Springer
14 years 1 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
COMPGEOM
2005
ACM
13 years 12 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
ESANN
2004
13 years 11 months ago
Face Recognition Using Recurrent High-Order Associative Memories
A novel face recognition approach is proposed, based on the use of compressed discriminative features and recurrent neural classifiers. Low-dimensional feature vectors are extract...
Iulian B. Ciocoiu
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 9 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer