Sciweavers

6274 search results - page 1058 / 1255
» Proofs, Programs, Processes
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 11 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
VLDB
2003
ACM
160views Database» more  VLDB 2003»
14 years 11 months ago
Composing Web services on the Semantic Web
Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexibl...
Brahim Medjahed, Athman Bouguettaya, Ahmed K. Elma...
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 11 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
DCC
2005
IEEE
14 years 10 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICWS
2009
IEEE
14 years 8 months ago
A Plug-in Architecture for Self-Adaptive Web Service Compositions
Abstract—Several approaches have been proposed to introduce self-management capabilities for web service compositions. However, most of these works are limited as they are not ex...
Anis Charfi, Tom Dinkelaker, Mira Mezini
« Prev « First page 1058 / 1255 Last » Next »