7978 search results - page 1456 / 1596 » Combining shared-coin algorithms |
OPODIS
2007
14 years 11 months ago
2007
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
VMV
2004
14 years 11 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
ACL
1998
14 years 11 months ago
1998
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
102
click to vote
VMV
2003
14 years 11 months ago
2003
198 Triangles Std. Wire Frame 2 Triangles 32×32 Texture Finite element models used in crash worthiness simulations now contain more than one million mostly quadrilateral elements...