Sciweavers

1991 search results - page 239 / 399
» Small Models of Large Machines
Sort
View
PODS
1993
ACM
161views Database» more  PODS 1993»
15 years 8 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
AMDO
2006
Springer
15 years 8 months ago
Matching Deformable Features Based on Oriented Multi-scale Filter Banks
This paper presents a technique to enable deformable objects to be matched throughout video sequences based on the information provided by multi-scale Gaussian derivative filter ba...
Manuel J. Marín-Jiménez, Nicolas P&e...
155
Voted
DEXAW
2004
IEEE
88views Database» more  DEXAW 2004»
15 years 8 months ago
A Possible World Approach to Uncertain Relational Data
Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data ca...
Ander de Keijzer, Maurice van Keulen
ESANN
2001
15 years 6 months ago
Transfer functions: hidden possibilities for better neural networks
Abstract. Sigmoidal or radial transfer functions do not guarantee the best generalization nor fast learning of neural networks. Families of parameterized transfer functions provide...
Wlodzislaw Duch, Norbert Jankowski
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...