Sciweavers

3446 search results - page 92 / 690
» A Reasoning Algorithm for pD*
Sort
View
ICCV
2009
IEEE
14 years 11 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
CADE
2008
Springer
16 years 1 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
IJCAI
2007
15 years 2 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
CADE
2010
Springer
15 years 2 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
14 years 5 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier