9572 search results - page 1759 / 1915 » Cover Algorithms and Their Combination |
114
click to vote
OPODIS
2007
15 years 5 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...
137
Voted
SODA
2004
ACM
15 years 5 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...
152
click to vote
VMV
2004
15 years 5 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...
111
click to vote
ACL
1998
15 years 5 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...
159
click to vote
VMV
2003
15 years 5 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...