Sciweavers

2107 search results - page 37 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
JSC
2010
99views more  JSC 2010»
13 years 6 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
CVPR
2007
IEEE
14 years 9 months ago
Tracking Large Variable Numbers of Objects in Clutter
We propose statistical data association techniques for visual tracking of enormously large numbers of objects. We do not assume any prior knowledge about the numbers involved, and...
Margrit Betke, Diane E. Hirsh, Angshuman Bagchi, N...
VTS
2008
IEEE
136views Hardware» more  VTS 2008»
14 years 2 months ago
Test-Pattern Grading and Pattern Selection for Small-Delay Defects
Timing-related defects are becoming increasingly important in nanometer technology designs. Small delay variations induced by crosstalk, process variations, powersupply noise, as ...
Mahmut Yilmaz, Krishnendu Chakrabarty, Mohammad Te...
ICCV
1995
IEEE
13 years 11 months ago
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
Gabriel Taubin
CIKM
1998
Springer
13 years 12 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang