Sciweavers

922 search results - page 22 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
EUROPAR
2006
Springer
13 years 11 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
PSSS
2003
13 years 9 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
DM
2007
68views more  DM 2007»
13 years 7 months ago
Extension of Arrow's theorem to symmetric sets of tournaments
Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregati...
Eyal Beigman
INFOCOM
2002
IEEE
14 years 19 days ago
Real-time Model and Convergence Time of BGP
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
Davor Obradovic
ACL
1996
13 years 9 months ago
Higher-Order Coloured Unification and Natural Language Semantics
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
Claire Gardent, Michael Kohlhase