Sciweavers

1312 search results - page 225 / 263
» Construction of BPMN-based Business Process Model Base
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 1 days ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
WWW
2003
ACM
16 years 13 days ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
80
Voted
ICIP
2004
IEEE
16 years 1 months ago
Improved dictionaries for generalized bitplanes-based matching pursuits video coding using ridgelets
A novel decomposition of functions using generalized bitplanes has been recently proposed. Such a decomposition maps a function into a set of indexes, thus performing quantization...
Leonardo H. Fonteles, Rogèrio Caetano, Edua...
COLCOM
2005
IEEE
15 years 5 months ago
Matching distributed systems to their environment using dissipative structures
In contrast to a large body of theoretical work on computer systems, distributed systems are not idealised constructions, unconstrained by physical world limitations. They must be...
Jim Dowling, Dominik Dahlem, Jan Sacha
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande