Sciweavers

5153 search results - page 427 / 1031
» Introduction to Randomized Algorithms
Sort
View
DAC
2002
ACM
16 years 6 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
ICMCS
2008
IEEE
211views Multimedia» more  ICMCS 2008»
15 years 11 months ago
A real-time video surveillance system with human occlusion handling using nonlinear regression
This paper presents a real-time single-camera surveillance system, aiming at detecting and partly analyzing a group of people. A set of moving persons is segmented using a combina...
Jungong Han, Minwei Feng, Peter H. N. de With
139
Voted
EMO
2005
Springer
123views Optimization» more  EMO 2005»
15 years 10 months ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 10 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
100
Voted
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 10 months ago
Don't Compare Averages
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
Holger Bast, Ingmar Weber