452 search results - page 57 / 91 » A mean field approach for optimization in discrete time |
COMPGEOM
1994
ACM
15 years 1 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
141
click to vote
PODC
2011
ACM
14 years 17 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
MVA
1990
14 years 11 months ago
1990
This report discusses a method that uses optical flow to estimate facial muscle movements which could then be recognized these movements as facial expressions. The. human face has...
JMLR
2006
14 years 9 months ago
2006
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special T...
117
click to vote
VIS
2004
IEEE
15 years 11 months ago
2004
IEEE
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...