Sciweavers

2716 search results - page 511 / 544
» Computational Topology for Shape Modeling
Sort
View
FSTTCS
2008
Springer
13 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
SIGGRAPH
1998
ACM
14 years 1 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
WG
2010
Springer
13 years 7 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
JMLR
2010
119views more  JMLR 2010»
13 years 3 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
CGF
2006
126views more  CGF 2006»
13 years 8 months ago
Soft Shadow Maps: Efficient Sampling of Light Source Visibility
Shadows, particularly soft shadows, play an important role in the visual perception of a scene by providing visual cues about the shape and position of objects. Several recent alg...
Lionel Atty, Nicolas Holzschuch, Marc Lapierre, Je...