Sciweavers

177 search results - page 20 / 36
» Logical complexity of graphs: a survey
Sort
View
OTM
2007
Springer
14 years 1 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
WSFM
2007
Springer
14 years 1 months ago
Towards a Theory of Web Service Choreographies
A fundamental promise of service oriented architecture (SOA) lies in the ease of integrating sharable information, processes, and other resources through interactions among the sha...
Jianwen Su, Tevfik Bultan, Xiang Fu, Xiangpeng Zha...
VLDB
1989
ACM
137views Database» more  VLDB 1989»
13 years 11 months ago
Pasta-3's Graphical Query Language: Direct Manipulation, Cooperative Queries, Full Expressive Power
Graphical Direct Manipulation (GrDM) query languagesare characterized and positioned with respect to traditional textual query languages. After a brief survey of the current state...
Michel Kuntz, Rainer Melchert
ISMB
1993
13 years 9 months ago
Representation for Discovery of Protein Motifs
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
FOCS
1998
IEEE
13 years 12 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello