5115 search results - page 417 / 1023 » On Randomized Lanczos Algorithms |
190
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
184
click to vote
TACAS
2005
Springer
16 years 1 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
224
click to vote
CVPR
2010
IEEE
16 years 27 days ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...
196
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
288
click to vote
ICDT
2009
ACM
16 years 8 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...