Sciweavers

8196 search results - page 207 / 1640
» Computational Modeling and Complexity Science
Sort
View
FMCO
2005
Springer
101views Formal Methods» more  FMCO 2005»
16 years 16 hour ago
Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo M...
WSCG
2004
166views more  WSCG 2004»
15 years 7 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
CPC
2002
75views more  CPC 2002»
15 years 6 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
MOBIHOC
2008
ACM
16 years 6 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
ICCV
2005
IEEE
16 years 3 days ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong