450 search results - page 52 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
CONEXT
2008
ACM
15 years 1 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
JCP
2007
14 years 11 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
104
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
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...
ICPR
2004
IEEE
16 years 29 days ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...