Sciweavers

4744 search results - page 252 / 949
» Connected Computing
Sort
View
FUIN
2010
158views more  FUIN 2010»
15 years 4 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 4 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
16 years 1 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu
SAT
2009
Springer
109views Hardware» more  SAT 2009»
16 years 1 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
16 years 1 months ago
Loss tolerance scheme for 3D progressive meshes streaming over networks
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
Hui Li, Ziying Tang, Xiaohu Guo, Balakrishnan Prab...