Sciweavers

567 search results - page 112 / 114
» Reconstructing Numbers from Pairwise Function Values
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
13 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
ECCV
2010
Springer
13 years 11 months ago
Fast Covariance Computation and Dimensionality Reduction for Sub-Window Features in Images
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
PODS
1999
ACM
121views Database» more  PODS 1999»
13 years 10 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
GLVLSI
1998
IEEE
124views VLSI» more  GLVLSI 1998»
13 years 10 months ago
Non-Refreshing Analog Neural Storage Tailored for On-Chip Learning
In this research, we devised a new simple technique for statically holding analog weights, which does not require periodic refreshing. It further contains a mechanism to locally u...
Bassem A. Alhalabi, Qutaibah M. Malluhi, Rafic A. ...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 10 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...