Sciweavers

5608 search results - page 358 / 1122
» On the Theory of Matchgate Computations
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
15 years 6 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
CIKM
2010
Springer
15 years 5 months ago
Domain-independent entity coreference in RDF graphs
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
Dezhao Song, Jeff Heflin
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
TON
2010
109views more  TON 2010»
15 years 5 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu
SEMWEB
2010
Springer
15 years 4 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...