Sciweavers

6575 search results - page 1010 / 1315
» Specializing visualization algorithms
Sort
View
PAMI
1998
100views more  PAMI 1998»
15 years 2 months ago
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
Ulf Grenander, Michael I. Miller, Anuj Srivastava
94
Voted
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 2 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
134
Voted
TNN
1998
132views more  TNN 1998»
15 years 2 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi
150
Voted
TCAD
2002
118views more  TCAD 2002»
15 years 2 months ago
Application-specific clustered VLIW datapaths: early exploration on a parameterized design space
Specialized clustered very large instruction word (VLIW) processors combined with effective compilation techniques enable aggressive exploitation of the high instruction-level para...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
132
Voted
IJCV
2008
157views more  IJCV 2008»
15 years 2 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
« Prev « First page 1010 / 1315 Last » Next »