Sciweavers

3466 search results - page 120 / 694
» Fast computation of special resultants
Sort
View
CVPR
2000
IEEE
15 years 5 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
111
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 27 days ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
127
Voted
CN
2006
82views more  CN 2006»
15 years 26 days ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
108
Voted
TSMC
2008
138views more  TSMC 2008»
15 years 21 days ago
Fast Diagnosis With Sensors of Uncertain Quality
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
Ozgur Erdinc, Craig Brideau, Peter Willett, Thiaga...
99
Voted
ISSAC
2007
Springer
146views Mathematics» more  ISSAC 2007»
15 years 7 months ago
Fast and exact geometric analysis of real algebraic plane curves
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
Arno Eigenwillig, Michael Kerber, Nicola Wolpert