4539 search results - page 337 / 908 » Approaches to Compute Workflow Complexity |
210
click to vote
NAACL
2010
15 years 4 months ago
2010
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
184
Voted
BALT
2010
15 years 1 months ago
2010
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
256
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
192
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
185
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and comple...