Sciweavers

697 search results - page 42 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
PVLDB
2010
140views more  PVLDB 2010»
13 years 6 months ago
Optimal Top-K Query Evaluation for Weighted Business Processes
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
Daniel Deutch, Tova Milo, Neoklis Polyzotis, Tom Y...
ISMB
2000
13 years 9 months ago
An Evaluation of Ontology Exchange Languages for Bioinformatics
Ontologies are specifications of the concepts in a given field, and of the relationships among those concepts. The development of ontologies for molecular-biology information and ...
Robin McEntire, Peter D. Karp, Neil F. Abernethy, ...
ICALP
2007
Springer
14 years 2 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
FP
1992
135views Formal Methods» more  FP 1992»
13 years 12 months ago
High Level Specification of I/O in Functional Languages
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....