1819 search results - page 13 / 364 » Computability and Representations of the Zero Set |
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
GBRPR
2009
Springer
14 years 3 months ago
2009
Springer
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
Geodesic curves in surfaces are not only minimizers of distance, but they are also the curves of zero geodesic (sideways) curvature. It turns out that this property makes patterns...
JC
2007
13 years 8 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...