Sciweavers

3396 search results - page 378 / 680
» Tree representations of graphs
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 5 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
BPM
2006
Springer
166views Business» more  BPM 2006»
15 years 10 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
BMCBI
2007
153views more  BMCBI 2007»
15 years 6 months ago
An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network
Background: Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this ...
Brian J. Holden, John W. Pinney, Simon C. Lovell, ...
EACL
1993
ACL Anthology
15 years 8 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
DATE
2005
IEEE
119views Hardware» more  DATE 2005»
16 years 10 days ago
Functional Validation of System Level Static Scheduling
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for comparing...
Samar Abdi, Daniel D. Gajski