2040 search results - page 154 / 408 » Approximate Expectation Maximization |
130
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
111
Voted
ALT
2006
Springer
16 years 11 days ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
111
Voted
SSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
140
Voted
ADAEUROPE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
125
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...