Sciweavers

900 search results - page 90 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
FUIN
2010
158views more  FUIN 2010»
13 years 6 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
CCS
2007
ACM
14 years 3 months ago
A k-anonymous communication protocol for overlay networks
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
Pan Wang, Peng Ning, Douglas S. Reeves
SEMWEB
2010
Springer
13 years 6 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 11 months ago
From user comments to on-line conversations
We present an analysis of user conversations in on-line social media and their evolution over time. We propose a dynamic model that predicts the growth dynamics and structural pro...
Chunyan Wang, Mao Ye, Bernardo A. Huberman
TVLSI
2008
110views more  TVLSI 2008»
13 years 8 months ago
Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...
Sanjukta Bhanja, Sudeep Sarkar