Sciweavers

16430 search results - page 667 / 3286
» On Computable Tree Functions
Sort
View
DFG
2007
Springer
16 years 1 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
EUROPAR
2007
Springer
16 years 1 months ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
16 years 1 months ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
SEMWEB
2007
Springer
16 years 1 months ago
OWL-CM: OWL Combining Matcher based on Belief Functions Theory
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology mapping process. On the one hand, OWL-CM uses the techniq...
Boutheina Ben Yaghlane, Najoua Laamari
ICAS
2006
IEEE
145views Robotics» more  ICAS 2006»
16 years 1 months ago
A Model-Driven Development Framework for Non-Functional Aspects in Service Oriented Grids
Service-oriented grids are grid computing systems built with the notion of service-oriented architecture (SOA). Using two maract concepts, services and connections between service...
Hiroshi Wada, Junichi Suzuki, Katsuya Oba