Sciweavers

4074 search results - page 82 / 815
» Defining Computational Aesthetics
Sort
View
COCOA
2009
Springer
14 years 2 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
HOTOS
2009
IEEE
14 years 1 months ago
Wave Computing in the Cloud
We introduce the new Wave model for exposing the temporal relationship among the queries in data-intensive distributed computing. The model defines the notion of query series to c...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, W...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...
PERCOM
2008
ACM
13 years 10 months ago
Composing software services in the pervasive computing environment: Languages or APIs?
The pervasive computing environment will be composed of heterogeneous services. In this work, we have explored how a domain specific language for service composition can be implem...
Jon Robinson, Ian Wakeman, Dan Chalmers
ICWE
2010
Springer
13 years 8 months ago
Modeling Search Computing Applications
Search Computing defines a new class of applications, which enable end users to perform exploratory search processes over multi-domain data sources available on the Web. These appl...
Alessandro Bozzon, Marco Brambilla, Alessandro Cam...