Sciweavers

650 search results - page 10 / 130
» Progressive simplicial complexes
Sort
View
IDA
2002
Springer
13 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
FOCS
1997
IEEE
14 years 2 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
CSCW
2012
ACM
12 years 5 months ago
Come meet me at Ulduar: progression raiding in world of warcraft
In spite of decades of research on virtual worlds, our understanding of one popular form of virtual world behavior— raiding—remains limited. Raiding is important because it en...
Jeffrey Bardzell, Jeffrey Nichols, Tyler Pace, Sha...
DCG
2008
77views more  DCG 2008»
13 years 10 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo
GC
2011
Springer
13 years 1 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff