Sciweavers

1552 search results - page 22 / 311
» On the Complexity of Constant Propagation
Sort
View
88
Voted
BIRTHDAY
2003
Springer
15 years 7 months ago
On the Computational Complexity of Hierarchical Radiosity
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
Robert Garmann, Heinrich Müller
DLOG
2008
15 years 4 months ago
Subsumption Propagation between Remote Ontologies in Distributed Description Logic
Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DD...
Martin Homola
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 12 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
100
Voted
CSCLP
2003
Springer
15 years 7 months ago
Implementing Propagators for Tabular Constraints
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Roman Barták, Roman Mecl
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 8 months ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik