Sciweavers

1242 search results - page 158 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CSUR
2004
91views more  CSUR 2004»
14 years 9 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
SEMWEB
2010
Springer
14 years 7 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...
SIAMREV
2010
170views more  SIAMREV 2010»
14 years 4 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
AAAI
2006
14 years 11 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...