Sciweavers

3702 search results - page 239 / 741
» All Pairings Are in a Group
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 6 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
ESWS
2005
Springer
16 years 6 days ago
OWL-Eu: Adding Customised Datatypes into OWL
Although OWL is rather expressive, it has a very serious limitation on datatypes; i.e., it does not support customised datatypes. It has been pointed out that many potential users...
Jeff Z. Pan, Ian Horrocks
170
Voted
MDM
2005
Springer
16 years 4 days ago
Concept-based discovery of mobile services
In this paper, we consider semantic service discovery in a global computing environment. We propose creating a dynamic overlay network by grouping together semantically related se...
Chara Skouteli, George Samaras, Evaggelia Pitoura
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
16 years 1 days ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
ROBOCUP
2004
Springer
103views Robotics» more  ROBOCUP 2004»
16 years 13 hour ago
Sharing Belief in Teams of Heterogeneous Robots
This paper describes the joint approach of three research groups to enable a heterogeneous team of robots to exchange belief. The communication framework presented imposes little r...
Hans Utz, Freek Stulp, Arndt Mühlenfeld